Related references
Note: Only part of the references are listed.A hybrid placement strategy for the three-dimensional strip packing problem
S. D. Allen et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2011)
Generalized hyper-heuristics for solving 2D Regular and Irregular Packing Problems
H. Terashima-Marin et al.
ANNALS OF OPERATIONS RESEARCH (2010)
A beam search implementation for the irregular shape packing problem
Julia A. Bennell et al.
JOURNAL OF HEURISTICS (2010)
A tutorial in irregular shape packing problems
J. A. Bennell et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2009)
The geometry of nesting problems: A tutorial
Julia A. Bennell et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2008)
An improved typology of cutting and packing problems
Gerhard Wascher et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
Complete and robust no-fit polygon generation for the irregular stock cutting problem
E. K. Burke et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem
Edmund Burke et al.
OPERATIONS RESEARCH (2006)
A 2-exchange heuristic for nesting problems
AM Gomes et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2002)
An algorithm for polygon placement using a bottom-left strategy
KA Dowsland et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2002)
A review of the application of meta-heuristic algorithms to 2D strip packing problems
E Hopper et al.
ARTIFICIAL INTELLIGENCE REVIEW (2001)
Hybridising tabu search with optimisation techniques for irregular stock cutting
JA Bennell et al.
MANAGEMENT SCIENCE (2001)