Friendly bin packing instances without Integer Round-up Property
It is well known that the gap between the optimal values of bin packing and fractional bin packing, if the latter is rounded up to the closest integer, is almost always null. Known counterexamples to this for integer input values involve fairly large numbers. Specifically, the first one was derived in 1986 and involved a bin capacity of the order of a billion. Later in 1998 a counterexample with a bin capacity of the order of a million was found. In this paper we show a large number of counterexamples with bin capacity of the order of a hundred, showing that the gap may be positive even for numbers which arise in customary applications. The associated instances are constructed starting from the Petersen graph and using the fact that it is fractionally, but not integrally, 3-edge colorable.
KeywordsBin packing problem Integer Round-up Property Petersen graph
Mathematics Subject Classification90C11 Mixed integer programming 90C27 Combinatorial optimization 05C15 Coloring of graphs and hypergraphs 05C70 Factorization matching partitioning covering and packing
- 7.Rietz, J., Scheithauer, G., Terno, J.: Tighter bounds for the gap and non-IRUP constructions in the one-dimensional cutting stock problem. Optim. J. Math. Program. Oper. Res. 51, 927–963 (2002)Google Scholar
- 8.Caprara, A., Monaci, M.: Bidimensional packing by bilinear programming. Math. Program. 118, 75–108 (2009)Google Scholar
- 11.Scheitauer, G.: On the maxgap problem for cutting stock. J. Inform. Process. Cybernet. 30, 111–117 (1994)Google Scholar