A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs

Troels Martin Range, Dawid Kozlowski, Niels Christian Petersen. A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs. Computers & OR, 97:111-124, 2018. [doi]

@article{RangeKP18,
  title = {A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs},
  author = {Troels Martin Range and Dawid Kozlowski and Niels Christian Petersen},
  year = {2018},
  doi = {10.1016/j.cor.2018.04.013},
  url = {https://doi.org/10.1016/j.cor.2018.04.013},
  researchr = {https://researchr.org/publication/RangeKP18},
  cites = {0},
  citedby = {0},
  journal = {Computers & OR},
  volume = {97},
  pages = {111-124},
}