An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
DOI10.1016/j.cor.2017.05.009zbMath1391.90520OpenAlexW2615947676MaRDI QIDQ1652386
Kun He, Chu-Min Li, Hongsheng Lan, Yan Jin, Pengli Ji
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.05.009
Computational aspects related to convexity (52B55) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Related Items (2)
Uses Software
Cites Work
- An approximation algorithm for dissecting a rectangle into rectangles with specified areas
- A new heuristic algorithm for rectangle packing
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An efficient deterministic heuristic for two-dimensional rectangular packing
- Partitioning a square into rectangles: NP-Completeness and approximation algorithms
- Dynamic reduction heuristics for the rectangle packing area minimization problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- Exact and approximation algorithms for a soft rectangle packing problem
- How good are slicing floorplans?
- Orthogonal Packings in Two Dimensions
- Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
- PACKING SOFT RECTANGLES
- Computing and Combinatorics
- New heuristic and interactive approaches to 2D rectangular strip packing
This page was built for publication: An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
