Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
Year of publication: |
July 2017
|
---|---|
Authors: | Tönissen, D. D. ; Akker, J. M. van den ; Hoogeveen, J. A. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 83.2017, p. 125-139
|
Subject: | Two-stage stochastic programming | Recoverable robustness | Column generation | Branch-and-price | Multiple knapsack problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Stochastischer Prozess | Stochastic process | Dekompositionsverfahren | Decomposition method |
-
Decomposition approaches for recoverable robust optimization problems
Akker, J. M. van den, (2016)
-
Solving robust bin-packing problems with a branch-and-price approach
Schepler, Xavier, (2022)
-
Mathematical models and decomposition methods for the multiple knapsack problem
Dell'Amico, Mauro, (2019)
- More ...
-
Decomposition approaches for recoverable robust optimization problems
Akker, J. M. van den, (2016)
-
Parallel machine scheduling by column generation
Akker, J. M. van den, (1996)
-
A local search algorithm for train unit shunting with service scheduling
Broek, Roel van den, (2022)
- More ...