An efficient deterministic heuristic for two-dimensional rectangular packing
Authors:
- Kun HeKHKun He
- Wenqi HuangWHWenqi Huang
- Yan JinYJYan Jin
- 1 July 2012
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 39 (7) , 1355-1363
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61173180)
- Fundamental Research Funds for the Central Universities (2010MS099)
This publication has 23 references indexed in Scilit:
- A squeaky wheel optimisation methodology for two-dimensional strip packingComputers & Operations Research, 2011
- A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting ProblemINFORMS Journal on Computing, 2009
- A New Placement Heuristic for the Orthogonal Stock-Cutting ProblemOperations Research, 2004
- An effective quasi-human based heuristic for solving the rectangle packing problemEuropean Journal of Operational Research, 2002
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectanglesEuropean Journal of Operational Research, 1999
- On genetic algorithms for the packing of polygonsEuropean Journal of Operational Research, 1996
- A provably efficient algorithm for dynamic storage allocationJournal of Computer and System Sciences, 1989
- The Bottomn-Left Bin-Packing Heuristic: An Efficient ImplementationIEEE Transactions on Computers, 1983
- Orthogonal Packings in Two DimensionsSIAM Journal on Computing, 1980
- An Application of Bin-Packing to Multiprocessor SchedulingSIAM Journal on Computing, 1978