A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs
Troels Martin Range, Dawid Kozlowski, Niels Chr. Petersen
| Year of publication: |
September 2018
|
|---|---|
| Authors: | Range, Troels Martin ; Kozlowski, Dawid ; Petersen, Niels Christian |
| 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. 97.2018, p. 111-124
|
| Subject: | Stochastic Knapsack problem | Dynamic programming | Shortest path problem with resource constraints | Theorie | Theory | Dynamische Optimierung | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.cor.2018.04.013 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011872897