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 | Mathematische Optimierung | Mathematical programming | Stochastischer Prozess | Stochastic process |
-
Chance-constrained binary packing problems
Song, Yongjia, (2014)
-
Gemander, Patrick, (2023)
-
A stochastic integer programming approach to reserve staff scheduling with preferences
Perreault-Lafleur, Carl, (2025)
- More ...
-
Inventory management with partially observed nonstationary demand
Kosuch, Stefanie, (2010)
-
A completely positive representation of 0-1 linear programs with joint probabilistic constraints
Cheng, Jianqiang, (2013)
-
An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
Gicquel, Celine, (2014)
- More ...