An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
Authors:
- Pengli JiPJPengli Ji
- Kun HeKHKun He
- Yan JinYJYan Jin
- Hongsheng LanHLHongsheng Lan
- Chumin LiCLChumin Li
- 1 October 2017
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 86, 110-123
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Dynamic reduction heuristics for the rectangle packing area minimization problemEuropean Journal of Operational Research, 2015
- Exact and approximation algorithms for a soft rectangle packing problemOptimization, 2012
- An efficient deterministic heuristic for two-dimensional rectangular packingComputers & Operations Research, 2012
- A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problemJournal of Combinatorial Optimization, 2010
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problemEuropean Journal of Operational Research, 2007
- Fast floorplanning by look-ahead enabled recursive bipartitioningIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2006
- Partitioning a Square into Rectangles: NP-Completeness and Approximation AlgorithmsAlgorithmica, 2002
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problemEuropean Journal of Operational Research, 2001
- A Procedure for Placement of Standard-Cell VLSI CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- Orthogonal Packings in Two DimensionsSIAM Journal on Computing, 1980