Large proper gaps in bin packing and dual bin packing problems

We consider the one-dimensional skiving stock problem, also known as the dual bin packing problem, with the aim of maximizing the best known dual and proper dual gaps. We apply the methods of computational search of large gaps initially developed for the one-dimensional cutting stock problem, which is related to the bin packing problem. The best known dual gap is raised from 1.0476 to 1.1795. The proper dual gap is improved to 1.1319. We also apply a number of new heuristics developed for the skiving stock problem back to the cutting stock problem, raising the largest known proper gap from 1.0625 to 1.1.

[1]  Gilbert Laporte,et al.  An exact algorithm for the dual bin packing problem , 1995, Oper. Res. Lett..

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

[3]  Richard P. Stanley,et al.  Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property , 1980, SIAM J. Algebraic Discret. Methods.

[4]  Zeger Degraeve,et al.  Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem , 2006, Eur. J. Oper. Res..

[5]  Pratik J. Parikh,et al.  A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital , 2013, Eur. J. Oper. Res..

[6]  Sascha Kurz,et al.  Minimal Proper Non-IRUP Instances of the One-Dimensional Cutting Stock Problem , 2014, Discret. Appl. Math..

[7]  J. B. G. Frenk,et al.  Probabilistic Analysis of Algorithms for Dual Bin Packing Problems , 1991, J. Algorithms.

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

[9]  Christoph Nitsche,et al.  Tighter relaxations for the cutting stock problem , 1999, Eur. J. Oper. Res..

[10]  John L. Bruno,et al.  Probabilistic bounds for dual bin-packing , 1985, Acta Informatica.

[11]  L. Trotter,et al.  Integer Rounding for Polymatroid and Branching Optimization Problems , 1981 .

[12]  Odile Marcotte.  The cutting stock problem and integer rounding , 1985, Math. Program..

[13]  Fred W. Glover,et al.  A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem , 2004, J. Heuristics.

[14]  Blair D. Sullivan.  On a Conjecture of Andrica and Tomescu , 2012 .

[15]  Guntram Scheithauer,et al.  Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem , 1997, Oper. Res. Lett..

[16]  Joseph Y.-T. Leung,et al.  On a Dual Version of the One-Dimensional Bin Packing Problem , 1984, J. Algorithms.

[17]  Guntram Scheithauer,et al.  The modified integer round-up property of the one-dimensional cutting stock problem , 1995 .

[18]  Stephan Dempe,et al.  Large gaps in one-dimensional cutting stock problems , 2008, Discret. Appl. Math..

[19]  Mauro Dell'Amico,et al.  Friendly bin packing instances without Integer Round-up Property , 2015, Math. Program..

[20]  Guntram Scheithauer,et al.  About the Gap Between the Optimal Values of the Integer and Continuous Relaxation One-Dimensional Cutting Stock Problem , 1992 .

[21]  John Martinovic,et al.  The proper relaxation and the proper gap of the skiving stock problem , 2016, Math. Methods Oper. Res..

[22]  E. J. Zak.  The skiving stock problem as a counterpart of the cutting stock problem , 2003 .

[23]  John Martinovic,et al.  Integer rounding and modified integer rounding for the skiving stock problem , 2016, Discret. Optim..