A robust approach to the chance-constrained knapsack problem
Year of publication: |
2008
|
---|---|
Authors: | Klopfenstein, Olivier ; Nace, Dritan |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 36.2008, 5, p. 628-632
|
Subject: | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Stochastischer Prozess | Stochastic process | Operations Research | Operations research |
-
An asynchronous parallel Benders decomposition method for stochastic network design problems
Rahmaniani, Ragheb, (2021)
-
The operating room case-mix problem under uncertainty and nurses capacity constraints
Yahia, Zakaria, (2016)
-
Stochastic survivable network design problems : theory and practice
Ljubić, Ivana, (2017)
- More ...
-
Max-min fairness in multi-commodity flows
Nace, Dritan, (2008)
-
A robust approach to the chance-constrained knapsack problem
Klopfenstein, Olivier, (2008)
-
A robust approach to the chance-constrained knapsack problem
Klopfenstein, Olivier, (2008)
- More ...