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)
-
Irregular packing problems : a review of mathematical models
Leao, Aline A. S., (2020)
-
A hybrid evolutionary algorithm for the two-dimensional packing problem
Kierkosz, Igor, (2014)
- More ...
-
A branch-and-price framework for decomposing graphs into relaxed cliques
Gschwind, Timo, (2021)
-
Tilk, Christian, (2017)
-
Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
Gschwind, Timo, (2017)
- More ...