The Meet-in-the-Middle Principle for Cutting and Packing Problems

Cutting and packing (C&P) is a fundamental research area that models a large number of managerial and industrial optimization issues. A solution to a C&P problem basically consists of a set of one-...

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

[2]  Ramón Alvarez-Valdés,et al.  A branch-and-cut algorithm for the pallet loading problem , 2005, Comput. Oper. Res..

[3]  Nicos Christofides,et al.  An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..

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

[5]  Manuel Iori,et al.  Bin packing and cutting stock problems: Mathematical models and exact algorithms , 2016, Eur. J. Oper. Res..

[6]  J. C. Herz,et al.  Recursive computational procedure for two-dimensional stock cutting , 1972 .

[7]  Gleb Belov,et al.  LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility , 2013, Oper. Res..

[8]  R. Gomory,et al.  Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .

[9]  Ellis Horowitz,et al.  Computing Partitions with Applications to the Knapsack Problem , 1974, JACM.

[10]  Gleb Belov,et al.  LP bounds in various constraint programming approaches for orthogonal packing , 2012, Comput. Oper. Res..

[11]  José M. Valério de Carvalho,et al.  An integer programming model for two- and three-stage two-dimensional cutting stock problems , 2010, Eur. J. Oper. Res..

[12]  Gerhard Wäscher,et al.  An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

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

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

[15]  Marco A. Boschetti,et al.  An Exact Algorithm for the Two-Dimensional Strip-Packing Problem , 2010, Oper. Res..

[16]  Andreas Bortfeldt,et al.  Constraints in container loading - A state-of-the-art review , 2013, Eur. J. Oper. Res..

[17]  Mehdi Mrad,et al.  A branch-and-price algorithm for the two-stage guillotine cutting stock problem , 2013, J. Oper. Res. Soc..

[18]  Michel Gendreau,et al.  An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints , 2014, Oper. Res..

[19]  John E. Beasley,et al.  Algorithms for Unconstrained Two-Dimensional Guillotine Cutting , 1985 .

[20]  François Vanderbeck,et al.  A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem , 2001, Manag. Sci..

[21]  Guntram Scheithauer,et al.  The G4-Heuristic for the Pallet Loading Problem , 1996 .

[22]  José M. Valério de Carvalho,et al.  Exact solution of bin-packing problems using column generation and branch-and-bound , 1999, Ann. Oper. Res..

[23]  Daniele Vigo,et al.  Models and Bounds for Two-Dimensional Level Packing Problems , 2004, J. Comb. Optim..

[24]  Mauro Dell'Amico,et al.  Combinatorial Benders' Cuts for the Strip Packing Problem , 2014, Oper. Res..

[25]  John E. Beasley,et al.  An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure , 1985, Oper. Res..

[26]  Daniele Vigo,et al.  An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints , 2007, Transp. Sci..