Exact solution of the robust knapsack problem☆

@inproceedings{Monaci2013ExactSO,
  title={Exact solution of the robust knapsack problem☆},
  author={Michele Monaci and Ulrich Pferschy and Paolo Serafini},
  booktitle={Computers & OR},
  year={2013}
}
We consider an uncertain variant of the knapsack problem in which the weight of the items is not exactly known in advance, but belongs to a given interval, and an upper bound is imposed on the number of items whose weight differs from the expected one. For this problem, we provide a dynamic programming algorithm and present techniques aimed at reducing its space and time complexities. Finally, we computationally compare the performances of the proposed algorithm with those of different exact… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
17 Extracted Citations
25 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 17 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 25 references

Pferschy : A new fully polynomial approximation scheme for the knapsack problem

  • H. Kellerer, U.
  • Mathematical Programming Computation
  • 2012

Kutschka : Recoverable Robust Knapsacks : the Discrete Scenario Case

  • A. M. C. A. Koster, M.
  • Lecture Notes in Computer Science
  • 2011

Similar Papers

Loading similar papers…