Dynamic reduction heuristics for the rectangle packing area minimization problem
Year of publication: |
2015
|
---|---|
Authors: | He, Kun ; Ji, Pengli ; Li, Chu-Min |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 241.2015, 3 (16.3.), p. 674-685
|
Subject: | Packing | Floorplanning | Layout optimization | Area minimization | Open dimension problem | Heuristik | Heuristics | Theorie | Theory | Packproblem | Packing problem | Operations Research | Operations research | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Integer programming | Branch-and-Bound | Branch and Bound |
-
The parallel stack loading problem of minimizing the exact number of relocations
Tanaka, Shunji, (2024)
-
Chance-constrained multiple bin packing problem with an application to operating room planning
Wang, Shanshan, (2021)
-
Two dimensional guillotine cutting stock and scheduling problem in printing industry
Mostajabdaveh, Mahdi, (2022)
- More ...
-
Ji, Pengli, (2017)
-
Dynamic reduction heuristics for the rectangle packing area minimization problem
He, Kun, (2015)
-
A Quasi-Newton-based Floorplanner for fixed-outline floorplanning
Ji, Pengli, (2021)
- More ...