Title of article
A fast algorithm for strongly correlated knapsack problems Original Research Article
Author/Authors
David Pisinger، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
16
From page
197
To page
212
Abstract
We consider a variant of the 0–1 Knapsack Problem, where the profit of each item corresponds to its weight plus a fixed constant. These so-called Strongly Correlated Knapsack Problems have attained much interest due to their apparent hardness and wide applicability in several fixed-charge problems.
Keywords
Fixed-charge Problem , Knapsack problem , Dynamic programming , Memorization , Exact Algorithm
Journal title
Discrete Applied Mathematics
Serial Year
1998
Journal title
Discrete Applied Mathematics
Record number
884837
Link To Document