MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Contents

Download:
pdf
by David Pisinger
http://www.diku.dk/~pisinger/95-1.pdf
Add To MetaCart

Abstract:

1

Citations

30 A minimal algorithm for the 0-1 knapsack problem – Pisinger - 1997
25 A o(n) algorithm for the linear multiple choice knapsack problem and related problems. Information Processing Letters – Zemel - 1984
22 A minimal algorithm for the multiple-choice knapsack problem – Pisinger - 1995
15 The multiple-choice knapsack problem – Sinha, Zoltners - 1979
14 Discrete Optimization Algorithms – Syslo, Deo, et al. - 1983
10 A branch and bound algorithm for the generalized assignment problem – Ross, Soland - 1975
8 Core Problems in Knapsack Algorithms – Pisinger - 1999
6 The Multiple Loading Problem – Pisinger - 1995
4 The one dimensional cutting stock problem using two objectives – Sinuany-Stern, Winer - 1994
3 An O(nr) Algorithm for the Subset Sum Problem – Pisinger - 1995
3 A hybrid method for the 0-1 knapsack problem – Plateau, Elkihel - 1985
2 A minimal algorithm for the Bounded Knapsack Problem – Pisinger - 1995
2 On multicriteria optimization – Polak, Payne - 1976
2 On One-Row Linear Programs – Witzgal - 1977
1 Experiments with 0-1 Knapsack Problem Algorithms – Pisinger, Walukiewicz - 1989
1 Theorem 3. In V. Chvital, "Hard knapsack problems – Todd - 1980
View or Download | Add to My Collection | Correct Errors