Related references
Note: Only part of the references are listed.Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
John Martinovic et al.
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH (2019)
The Meet-in-the-Middle Principle for Cutting and Packing Problems
Jean-Francois Cote et al.
INFORMS JOURNAL ON COMPUTING (2018)
Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches
Thiago Alves de Queiroz et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2017)
On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
Thiago Alves de Queiroz et al.
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH (2015)
Combinatorial Benders' Cuts for the Strip Packing Problem
Jean-Francois Cote et al.
OPERATIONS RESEARCH (2014)
An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
Jean-Francois Cote et al.
OPERATIONS RESEARCH (2014)
The Knapsack Problem with Three Practical Constraints
Rainne Florisbelo Goncalves et al.
2014 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE (2014)
An exact strip packing algorithm based on canonical forms
Yohei Arahori et al.
COMPUTERS & OPERATIONS RESEARCH (2012)
Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing
Thiago A. de Queiroz et al.
COMPUTERS & OPERATIONS RESEARCH (2012)
A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
Stephen C. H. Leung et al.
COMPUTERS & OPERATIONS RESEARCH (2012)
New constructive algorithms for leather nesting in the automotive industry
Claudio Alves et al.
COMPUTERS & OPERATIONS RESEARCH (2012)
Three-dimensional container loading models with cargo stability and load bearing constraints
Leonardo Junqueira et al.
COMPUTERS & OPERATIONS RESEARCH (2012)
Heuristics for two-dimensional knapsack and cutting stock problems with items of irregular shape
Aline M. Del Valle et al.
EXPERT SYSTEMS WITH APPLICATIONS (2012)
Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm
E. G. Birgin et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2012)
A particular approach for the Three-dimensional Packing Problem with additional constraints
Ana de Almeida et al.
COMPUTERS & OPERATIONS RESEARCH (2010)
An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
E. G. Birgin et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2010)
An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
Marco Antonio Boschetti et al.
OPERATIONS RESEARCH (2010)
A branch and bound algorithm for the strip packing problem
R. Alvarez-Valdes et al.
OR SPECTRUM (2009)
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
G. F. Cintra et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2008)
Extreme point-based heuristics for three-dimensional bin packing
Teodor Gabriel Crainic et al.
INFORMS JOURNAL ON COMPUTING (2008)
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
Roberto Baldacci et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
An improved typology of cutting and packing problems
Gerhard Wascher et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
A branch-and-cut algorithm for the pallet loading problem
R Alvarez-Valdes et al.
COMPUTERS & OPERATIONS RESEARCH (2005)
On the two-dimensional knapsack problem
A Caprara et al.
OPERATIONS RESEARCH LETTERS (2004)
An L-approach for packing (l, w)-rectangles into rectangular and L-shaped pieces
L Lins et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2003)
An exact approach to the strip-packing problem
S Martello et al.
INFORMS JOURNAL ON COMPUTING (2003)
The three-dimensional bin packing problem
S Martello et al.
OPERATIONS RESEARCH (2000)
Share Paper
