Knapsack Problems

David Pisinger () and Paolo Toth ()
Additional contact information
David Pisinger: University of Copenhagen, DIKU
Paolo Toth: University of Bologna, DEIS

A chapter in Handbook of Combinatorial Optimization, 1998, pp 299-428 from Springer

Abstract: Abstract Knapsack Problems are the simplest NP-hard problems in Combinatorial Optimization, as they maximize an objective function subject to a single resource constraint. Several variants of the classical 0–1 Knapsack Problem will be considered with respect to relaxations, bounds, reductions and other algorithmic techniques for the exact solution. Computational results are presented to compare the actual performance of the most effective algorithms published.

Keywords: Knapsack Problem; Dynamic Programming Algorithm; Item Type; Lagrangian Relaxation; Continuous Relaxation (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0303-9_5

Ordering information: This item can be ordered from
http://www.springer.com/9781461303039

DOI: 10.1007/978-1-4613-0303-9_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().