Related references
Note: Only part of the references are listed.Orthogonal packing of identical rectangles within isotropic convex regions
Ernesto G. Birgin et al.
COMPUTERS & INDUSTRIAL ENGINEERING (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)
Using sentinels to detect intersections of convex and nonconvex polygons
W.F. Mascarenhas et al.
computational and applied mathematics (2010)
Heuristic approaches for the two- and three-dimensional knapsack packing problem
Jens Egeblad et al.
COMPUTERS & OPERATIONS RESEARCH (2009)
A least wasted first heuristic algorithm for the rectangular packing problem
Lijun Wei et al.
COMPUTERS & OPERATIONS RESEARCH (2009)
A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
Andreas Bortfeldt et al.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (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)
A tabu search algorithm for a two-dimensional non-guillotine cutting problem
R. Alvarez-Valdes et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
Roberto Baldacci et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
Jose Fernando Goncalves
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
An improved typology of cutting and packing problems
Gerhard Wascher et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
An efficient heuristic algorithm for rectangle-packing problem
Wenqi Huang et al.
SIMULATION MODELLING PRACTICE AND THEORY (2007)
Two-stage general block patterns for the two-dimensional cutting problem
Yaodong Cui et al.
COMPUTERS & OPERATIONS RESEARCH (2007)
A new heuristic algorithm for constrained rectangle-packing problem
Duanbing Chen et al.
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH (2007)
An exact algorithm for higher-dimensional orthogonal packing
Sandor P. Fekete et al.
OPERATIONS RESEARCH (2007)
Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
E. G. Birgin et al.
COMPUTERS & OPERATIONS RESEARCH (2006)
Method of sentinels for packing items within arbitrary convex regions
E. G. Birgin et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2006)
A note on an L-approach for solving the manufacturer's pallet loading problem
EG Birgin et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2005)
A population heuristic for constrained two-dimensional non-guillotine cutting
JE Beasley
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2004)
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)
Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
TW Leung et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2003)
A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
R Alvarez-Valdés et al.
COMPUTERS & OPERATIONS RESEARCH (2002)
An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
E Hopper et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2001)
Exact algorithms for large-scale unconstrained two and three staged cutting problems
M Hifi
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2001)
Packing small boxes into a big box
M Padberg
MATHEMATICAL METHODS OF OPERATIONS RESEARCH (2000)
Share Paper
