A Branch-and-Price Graph-Theoretical Algorithm for Orthogonal-Packing Feasibility

Contents 1. Introduction 1 1.1. Formulations and exact methods for OPP 1 1.2. Relaxations and bounds 2 1.3. Our contributions 2 2. The interval-graph model and a simplification 3 Discussion 4 3. An overview of the algorithm of Fekete and Schepers 4 3.

[1]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[2]  E. Hopper,et al.  An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem , 2001, Eur. J. Oper. Res..

[3]  Mats Carlsson,et al.  New filtering for the cumulative constraint in the context of non-overlapping rectangles , 2008, Ann. Oper. Res..

[4]  Daniele Vigo,et al.  An Exact Approach to the Strip-Packing Problem , 2003, INFORMS J. Comput..

[5]  Roberto Baldacci,et al.  A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem , 2007, Eur. J. Oper. Res..

[6]  Marco A. Boschetti,et al.  New upper bounds for the two‐dimensional orthogonal non‐guillotine cutting stock problem , 2002 .

[7]  Adam N. Letchford,et al.  Analysis of upper bounds for the Pallet Loading Problem , 2001, Eur. J. Oper. Res..

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

[9]  Hiroshi Nagamochi,et al.  Exact algorithms for the two-dimensional strip packing problem with and without rotations , 2009, Eur. J. Oper. Res..

[10]  Gleb Belov,et al.  One-dimensional relaxations and LP bounds for orthogonal packing , 2009, Int. Trans. Oper. Res..

[11]  Ramón Alvarez-Valdés,et al.  A branch and bound algorithm for the strip packing problem , 2009, OR Spectr..

[12]  M. Golummc.  Algorithmic graph theory and perfect graphs , 1980 .

[13]  Barry O'Sullivan,et al.  Search Strategies for Rectangle Packing , 2008, CP.

[14]  Manfred W. Padberg,et al.  Packing small boxes into a big box , 2000, Math. Methods Oper. Res..

[16]  Sándor P. Fekete,et al.  A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems , 2004, Math. Methods Oper. Res..

[17]  Cláudio Alves,et al.  Arc-flow model for the two-dimensional guillotine cutting stock problem , 2010, Comput. Oper. Res..

[18]  Antoine Jouglet,et al.  A new constraint programming approach for the orthogonal packing problem , 2008, Comput. Oper. Res..

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

[20]  Alexander Martin,et al.  General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms , 2000, Computational Combinatorial Optimization.

[21]  David Pisinger,et al.  Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem , 2007, INFORMS J. Comput..

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

[23]  Antoine Jouglet,et al.  A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems , 2008, WEA.

[24]  G. Scheithauer.  LP‐based bounds for the container and multi‐container loading problem , 1999 .

[25]  Eva Hopper,et al.  Two-dimensional Packing utilising Evolutionary Algorithms and other Meta-Heuristic Methods , 2002 .

[26]  Richard E. Korf.  Optimal Rectangle Packing: New Results , 2004, ICAPS.

[27]  J. Beasley.  Bounds for Two-Dimensional Cutting , 1985 .