Upper bounds for the 0-1 stochastic knapsack problem and a B&B algorithm
Year of publication: |
2010
|
---|---|
Authors: | Kosuch, Stefanie ; Lisser, Abdel |
Published in: |
Annals of operations research. - Dordrecht, The Netherlands : Springer Nature B.V., ISSN 0254-5330, ZDB-ID 252629-3. - Vol. 176.2010, p. 77-93
|
Subject: | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
Consistency cuts for Dantzig-Wolfe reformulations
Clausen, Jens Vinther, (2022)
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
- More ...
-
Inventory management with partially observed nonstationary demand
Kosuch, Stefanie, (2010)
-
Survivability in telecommunication networks
Lisser, Abdel, (1995)
-
Stochastic nuclear outages semidefinite relaxations
Gorge, Agnès, (2012)
- More ...