A fast implementation for the 2D/3D box placement problem
From MaRDI portal
Publication:5963685
DOI10.1007/S10589-015-9780-2zbMath1332.90229OpenAlexW1617736874MaRDI QIDQ5963685
Zhi-Xing Luo, Andrew E. B. Lim, Wee-Chong Oon, Wenbin Zhu
Publication date: 23 February 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9780-2
Cites Work
- Unnamed Item
- Unnamed Item
- A beam search implementation for the irregular shape packing problem
- On genetic algorithms for the packing of polygons
- An optimal algorithm for rectangle placement
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- An effective quasi-human based heuristic for solving the rectangle packing problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Irregular Packing Using the Line and Arc No-Fit Polygon
- A (slightly) faster algorithm for klee's measure problem
- Orthogonal Packings in Two Dimensions
- The measure problem for rectangular ranges in d-space
- New Upper Bounds in Klee’s Measure Problem
- Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
- Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices
This page was built for publication: A fast implementation for the 2D/3D box placement problem
