Stabilized branch-and-price algorithms for vector packing problems
| Year of publication: |
1 December 2018
|
|---|---|
| Authors: | Heßler, Katrin ; Gschwind, Timo ; Irnich, Stefan |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 271.2018, 2 (1.12.), p. 401-419
|
| Subject: | Cutting | Vector packing | Shortest path problem with resource constraints | Dual-optimal inequalities | Stabilization | Packproblem | Packing problem | Algorithmus | Algorithm | Heuristik | Heuristics | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming |
-
Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation
Barkel, Mathijs, (2025)
-
A beam search approach to solve the convex irregular bin packing problem with guillotine cuts
Bennell, J.A., (2018)
-
Irregular packing problems : a review of mathematical models
Leao, Aline A. S., (2020)
- More ...
-
Variable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models
Desaulniers, Guy, (2020)
-
A branch-and-price framework for decomposing graphs into relaxed cliques
Gschwind, Timo, (2021)
-
Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
Gschwind, Timo, (2018)
- More ...