Dynamic reduction heuristics for the rectangle packing area minimization problem
From MaRDI portal
Publication:2629714
DOI10.1016/j.ejor.2014.09.042zbMath1339.90197OpenAlexW4299650055MaRDI QIDQ2629714
Publication date: 6 July 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.09.042
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Discrete location and assignment (90B80)
Related Items (4)
A hybrid algorithm based on variable neighbourhood for the strip packing problem ⋮ A memetic algorithm to pack unequal circles into a square ⋮ An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules ⋮ Spatial scheduling optimization algorithm for block assembly in shipbuilding
Cites Work
- An efficient deterministic heuristic for two-dimensional rectangular packing
- A reduction approach for solving the rectangle packing area minimization problem
- Improved local search algorithms for the rectangle packing problem with general spatial costs
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- An improved typology of cutting and packing problems
- Denser Packings Obtained in O(n log log n) Time
- A Tree Search Algorithm for Solving the Container Loading Problem
- Stochastic Algorithms: Foundations and Applications
- A hybrid genetic algorithm for the container loading problem
This page was built for publication: Dynamic reduction heuristics for the rectangle packing area minimization problem