An EDA for the 2D knapsack problem with guillotine constraint
Year of publication: |
2019
|
---|---|
Authors: | Borgulya, István |
Published in: |
Central European journal of operations research : CEJOR ; official journal of the Austrian, Croatian, Czech, Hungarian, Slovakian and Slovenian OR Societies. - Berlin : Springer, ISSN 1435-246X, ZDB-ID 1178875-6. - Vol. 27.2019, 2, p. 329-356
|
Subject: | Cutting-packing | Knapsack | Guillotine-cut | EDA | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming |
-
Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem
Sbihi, A., (2013)
-
A dual heuristic for mixed integer programming
Li, Yaxian, (2015)
-
On the existence of compact image-approximated formulations for knapsack in the original space
Faenza, Yuri, (2015)
- More ...
-
An algorithm for the capacitated vehicle routing problem with route balancing
Borgulya, István, (2008)
-
An algorithm for the capacitated vehicle routing problem with route balancing
Borgulya, István, (2008)
-
An algorithm for the capacitated vehicle routing problem with route balancing
Borgulya, István, (2008)
- More ...