An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
Year of publication: |
September 2017
|
---|---|
Authors: | Ji, Pengli ; He, Kun ; Yan, Jin ; Lan, Hongsheng ; Li, Chu-Min |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 86.2017, p. 110-123
|
Subject: | Packing | Soft rectangle | Floorplanning | Layout optimization | Algorithmus | Algorithm | Theorie | Theory | Packproblem | Packing problem |
-
A Quasi-Newton-based Floorplanner for fixed-outline floorplanning
Ji, Pengli, (2021)
-
Dynamic reduction heuristics for the rectangle packing area minimization problem
He, Kun, (2015)
-
Exact approaches for the unconstrained two-dimensional cutting problem with defects
Zhang, Hao, (2023)
- More ...
-
Dynamic reduction heuristics for the rectangle packing area minimization problem
He, Kun, (2015)
-
An Efficient Solution Space Exploring and Descent Method for Packing Equal Spheres in a Sphere
Zhou, Jianrong, (2023)
-
An iterative Path-Breaking approach with mutation and restart strategies for the MAX-SAT problem
Xu, Zhenxing, (2019)
- More ...