Algorithms for some hard knapsack problems
The Knapsack Problems are among the simplest integer programs which are NP-hard. Problems in this class are typically concerned with selecting from a set of given items, each with a specified weight and value, a subset of items whose weight sum does not exceed a prescribed capacity and whose value i...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
Curtin University
2000
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/1101 |