An Effective Corner Increment-Based Algorithm for the Two-Dimensional Strip Packing Problem
Authors:
Open Access
- 22 November 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 72906-72924
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (11501115, 61672005)
This publication has 38 references indexed in Scilit:
- A simple randomized algorithm for two-dimensional strip packingComputers & Operations Research, 2013
- A two-stage intelligent search algorithm for the two-dimensional strip packing problemEuropean Journal of Operational Research, 2011
- A fast layer-based heuristic for non-guillotine strip packingExpert Systems with Applications, 2011
- One-dimensional heuristics adapted for two-dimensional rectangular strip packingJournal of the Operational Research Society, 2008
- A new heuristic algorithm for rectangle packingComputers & Operations Research, 2007
- New heuristic and interactive approaches to 2D rectangular strip packingACM Journal of Experimental Algorithmics, 2005
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problemEuropean Journal of Operational Research, 2001
- Two-Dimensional Finite Bin-Packing AlgorithmsJournal of the Operational Research Society, 1987
- Algorithms for Unconstrained Two-Dimensional Guillotine CuttingJournal of the Operational Research Society, 1985
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985