A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
Year of publication: |
16 October 2018
|
---|---|
Authors: | Wei, Lijun ; Hu, Qian ; Lim, Andrew ; Liu, Qiang |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 270.2018, 2 (16.10.), p. 448-474
|
Subject: | Packing | Cutting | Branch and bound | Non-guillotine | Best-fit | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research | Heuristik | Heuristics | Packproblem | Packing problem |
-
Dynamic reduction heuristics for the rectangle packing area minimization problem
He, Kun, (2015)
-
Lower bounds for a bin packing problem with linear usage cost
Braune, Roland, (2019)
-
Wei, Lijun, (2017)
- More ...
-
The two-dimensional vector packing problem with general costs
Hu, Qian, (2018)
-
A branch-and-price algorithm for the two-dimensional vector packing problem
Wei, Lijun, (2020)
-
An adaptive selection approach for the 2D rectangle packing area minimization problem
Wei, Lijun, (2018)
- More ...