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.

[1]  P. Pardalos,et al.  Handbook of Combinatorial Optimization , 1998 .

[2]  Cláudio Alves,et al.  A survey of dual-feasible and superadditive functions , 2010, Ann. Oper. Res..

[3]  Friedrich Eisenbrand,et al.  Bin packing via discrepancy of permutations , 2010, SODA '11.

[4]  Lap Mui Ann Chan,et al.  Worst-case analyses, linear programming and the bin-packing problem , 1998, Math. Program..

[5]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[6]  Daniele Vigo,et al.  Bin packing approximation algorithms: Survey and classification , 2013 .

[7]  Alberto Caprara,et al.  Bidimensional packing by bilinear programming , 2005, Math. Program..

[8]  José M. Valério de Carvalho,et al.  LP models for bin packing and cutting stock problems , 2002, Eur. J. Oper. Res..

[9]  Odile Marcotte.  An instance of the cutting stock problem for which the rounding property does not hold , 1986 .

[10]  Jürgen Rietz,et al.  Families of non-IRUP instances of the one-dimensional cutting stoc problem , 2002, Discret. Appl. Math..

[11]  Gleb Belov,et al.  A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting , 2006, Eur. J. Oper. Res..

[12]  Mauro Dell'Amico,et al.  Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem , 2008, INFORMS J. Comput..

[13]  Guntram Scheithauer.  On the MAXGAP Problem for Cutting Stock Problems , 1994, J. Inf. Process. Cybern..

[14]  Jürgen Rietz,et al.  Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem , 2002 .

[15]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .