New trends in exact algorithms for the 0-1 knapsack problem

By Silvano Martello, David Pisinger, Paolo Toth. European Journal of Operational Research, 2000

339 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/9b3e307cea9fb5cdca01b431d2f24c83354aea76

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Holger Schumann
2. Gerhard Wäscher
3. Heike Haußner
4. Steven S. Skiena
5. Arnaud Fréville
6. David Pisinger

In Industrial and Manufacturing Engineering

1. Gerhard Wäscher
2. Holger Schumann
3. Heike Haußner
4. Steven S. Skiena
5. Arnaud Fréville
6. David Pisinger
7. Stefan Røpke
8. Gilbert Laporte

Citations in the corpus

• The Algorithm Design Manual (2020, background): “See [MPT00] for a computational study of algorithms for 0-1 knapsack problems.”
• Where are the hard knapsack problems? (2005, background): “[1] or the monograph by Kellerer et al.”
• An improved typology of cutting and packing problems (2007, methodology): “The Classic (One-Dimensional) Knapsack Problem, also called 0-1-Knapsack Problem ( Martello et al., 2000; Martello and Toth, 1990, p. 13) which requires packing a given set of (different) items of given weights and values into a (single) knapsack of given limited weight capacity such that the value”
• The multidimensional 0-1 knapsack problem: An overview (2004, background): “Besides, several effective special-purpose codes are available to practitioners and researchers of the operations research community (by example among others FPK79 [47], MT2 and MTR [132], COMBO [134]).”