The Knapsack Problem

Chapter
First Online:
Part of the Algorithms and Combinatorics book series (AC, volume 21)

Abstract

The MINIMUM WEIGHT PERFECT MATCHING PROBLEM and the WEIGHTED MATROID INTERSECTION PROBLEM discussed in earlier chapters are among the “hardest" problems for which a polynomial-time algorithm is known.

Keywords

Nonnegative Integer Knapsack Problem Weighted Median Fully Polynomial Time Approximation Scheme Minimum Cost Flow Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Garey, M.R., and Johnson, D.S. [1979]: Computers and Intractability; A Guide to the Theory of NP-Completeness. Freeman, San Francisco 1979, Chapter 4Google Scholar
  2. Kellerer, H., Pferschy, U., and Pisinger, D. [2004]: Knapsack Problems. Springer, Berlin 2004MATHGoogle Scholar
  3. Martello, S., and Toth, P. [1990]: Knapsack Problems; Algorithms and Computer Implementations. Wiley, Chichester 1990MATHGoogle Scholar
  4. Papadimitriou, C.H., and Steiglitz, K. [1982]: Combinatorial Optimization; Algorithms and Complexity. Prentice-Hall, Englewood Cliffs 1982, Sections 16.2, 17.3, and 17.4Google Scholar
  5. Bellman, R. [1956]: Notes on the theory of dynamic programming IV – maximization over discrete sets. Naval Research Logistics Quarterly 3 (1956), 67–70CrossRefMathSciNetGoogle Scholar
  6. Bellman, R. [1957]: Comment on Dantzig’s paper on discrete variable extremum problems. Operations Research 5 (1957), 723–724CrossRefGoogle Scholar
  7. Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., and Tarjan, R.E. [1973]: Time bounds for selection. Journal of Computer and System Sciences 7 (1973), 448–461CrossRefMATHMathSciNetGoogle Scholar
  8. Dantzig, G.B. [1957]: Discrete variable extremum problems. Operations Research 5 (1957), 266–277CrossRefMathSciNetGoogle Scholar
  9. Frieze, A.M. and Clarke, M.R.B. [1984]: Approximation algorithms for the m-dimensional 0-1 knapsack problem: worst case and probablistic analyses. European Journal of Operations Research 15 (1984), 100–109CrossRefMATHMathSciNetGoogle Scholar
  10. Garey, M.R., and Johnson, D.S. [1978]: Strong NP-completeness results: motivation, examples, and implications. Journal of the ACM 25 (1978), 499–508CrossRefMATHMathSciNetGoogle Scholar
  11. Gens, G.V., and Levner, E.V. [1979]: Computational complexity of approximation algorithms for combinatorial problems. In: Mathematical Foundations of Computer Science; LNCS 74 (J. Becvar, ed.), Springer, Berlin 1979, pp. 292–300Google Scholar
  12. Ibarra, O.H., and Kim, C.E. [1975]: Fast approximation algorithms for the knapsack and sum of subset problem. Journal of the ACM 22 (1975), 463–468CrossRefMATHMathSciNetGoogle Scholar
  13. Karp, R.M. [1972]: Reducibility among combinatorial problems. In: Complexity of Computer Computations (R.E. Miller, J.W. Thatcher, eds.), Plenum Press, New York 1972, pp. 85–103Google Scholar
  14. Kellerer, H., and Pferschy, U. [2004]: Improved dynamic programming in connection with an FPTAS for the knapsack problem. Journal on Combinatorial Optimization 8 (2004), 5–11CrossRefMATHMathSciNetGoogle Scholar
  15. Korte, B., and Schrader, R. [1981]: On the existence of fast approximation schemes. In: Nonlinear Programming; Vol. 4 (O. Mangaserian, R.R. Meyer, S.M. Robinson, eds.), Academic Press, New York 1981, pp. 415–437Google Scholar
  16. Lawler, E.L. [1979]: Fast approximation algorithms for knapsack problems. Mathematics of Operations Research 4 (1979), 339–356CrossRefMATHMathSciNetGoogle Scholar
  17. Pisinger, D. [1999]: Linear time algorithms for knapsack problems with bounded weights. Journal of Algorithms 33 (1999), 1–14CrossRefMATHMathSciNetGoogle Scholar
  18. Sahni, S. [1976]: Algorithms for scheduling independent tasks. Journal of the ACM 23 (1976), 114–127Google Scholar
  19. Vygen, J. [1997]: The two-dimensional weighted median problem. Zeitschrift für Angewandte Mathematik und Mechanik 77 (1997), Supplement, S433–S436Google Scholar
  20. Woeginger, G.J. [2000]: When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS Journal on Computing 12 (2000), 57–74CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Research Institute for Discrete MathematicsUniversity of BonnBonnGermany

Personalised recommendations