A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority

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

[2]  Yen-Hung Lin,et al.  A decomposition-based approach for the selection of standardized modular containers , 2014 .

[3]  Andrew Lim,et al.  The six elements to block-building approaches for the single container loading problem , 2012, Applied Intelligence.

[4]  Célia Paquay,et al.  A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application , 2016, Int. Trans. Oper. Res..

[5]  Kathryn A. Dowsland,et al.  A comparative review of 3D container loading algorithms , 2016, Int. Trans. Oper. Res..

[6]  Flávio Keidi Miyazawa,et al.  Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints , 2013 .

[7]  Benoît Montreuil,et al.  Toward a Physical Internet: meeting the global logistics sustainability grand challenge , 2011, Logist. Res..

[8]  Reinaldo Morabito,et al.  Three-dimensional container loading models with cargo stability and load bearing constraints , 2012, Comput. Oper. Res..

[9]  Sara Ceschia,et al.  Local search for a multi-drop multi-container loading problem , 2013, J. Heuristics.

[10]  Christian Landschützer,et al.  Containers for the Physical Internet: requirements and engineering design related to FMCG logistics , 2015, Logist. Res..

[11]  Sándor P. Fekete,et al.  A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing , 2003, Math. Oper. Res..

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

[13]  Henrik I. Christensen,et al.  Approximation and online algorithms for multidimensional bin packing: A survey , 2017, Comput. Sci. Rev..

[14]  Sándor P. Fekete,et al.  An Exact Algorithm for Higher-Dimensional Orthogonal Packing , 2006, Oper. Res..

[15]  H. Kellerer,et al.  Introduction to NP-Completeness of Knapsack Problems , 2004 .

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

[17]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[18]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

[19]  Lei Wu,et al.  A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem , 2010, Electron. Notes Discret. Math..

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

[21]  Benoît Montreuil,et al.  On the activeness of intelligent Physical Internet containers , 2016, Comput. Ind..

[22]  Paul E. Sweeney,et al.  Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography , 1992 .

[23]  Katsuhisa Ohno,et al.  The Three-Dimensional Bin Packing Problem and Its Practical Algorithm , 2003 .

[24]  David Pisinger,et al.  The load-balanced multi-dimensional bin-packing problem , 2016, Comput. Oper. Res..