Skip to main content
SpringerLink
Log in

Das Knapsack-Problem

  • Chapter
  • First Online:
Kombinatorische Optimierung

Part of the book series: Masterclass ((MASTERCLASS))

  • 6384 Accesses

Zusammenfassung

Das Knapsack-Problem ist gewissermaßen das einfachste NP-schwere Problem. Wir geben unter anderem ein voll polynomielles Approximationsschema an und führen eine geglätte Analyse durch, die zeigt, dass man das Problem in der Praxis oft optimal lösen kann.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

Allgemeine Literatur:

  • Garey, M.R., und Johnson, D.S. [1979]: Computers and Intractability; A Guide to the Theory of NP-Completeness. Freeman, San Francisco 1979, Kapitel 4

    Google Scholar 

  • Kellerer, H., Pferschy, U., und Pisinger, D. [2004]: Knapsack Problems. Springer, Berlin 2004

    Google Scholar 

  • Martello, S., und Toth, P. [1990]: Knapsack Problems; Algorithms and Computer Implementations. Wiley, Chichester 1990

    Google Scholar 

  • Papadimitriou, C.H., und Steiglitz, K. [1982]: Combinatorial Optimization; Algorithms and Complexity. Prentice-Hall, Englewood Cliffs 1982, Abschnitte 16.2, 17.3 und 17.4

    Google Scholar 

Zitierte Literatur:

  • Balas, E., und Zemel, E. [1980]: An algorithm for large zero-one knapsack problems. Operations Research 28 (1980), 1130–1154

    Article  MathSciNet  Google Scholar 

  • Beier, R., Röglin, H., und Vöcking, B. [2007]: The smoothed number of Pareto optimal solutions in bicriteria integer optimization. In: Integer Programming and Combinatorial Optimization; Proceedings of the 12th International IPCO Conference; LNCS 4513 (M. Fischetti, D.P. Williamson, Hrsg.), Springer, Berlin 2007, pp. 53–67

    Google Scholar 

  • Beier, R., und Vöcking, B. [2006]: An experimental study of random knapsack problems. Algorithmica 45 (2006), 121–136

    Article  MathSciNet  Google Scholar 

  • Bellman, R. [1956]: Notes on the theory of dynamic programming IV – maximization over discrete sets. Naval Research Logistics Quarterly 3 (1956), 67–70

    Article  MathSciNet  Google Scholar 

  • Bellman, R. [1957]: Comment on Dantzig’s paper on discrete variable extremum problems. Operations Research 5 (1957), 723–724

    Article  Google Scholar 

  • Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., und Tarjan, R.E. [1973]: Time bounds for selection. Journal of Computer and System Sciences 7 (1973), 448–461

    Article  MathSciNet  Google Scholar 

  • Carr, R.D., Fleischer, L.K., Leung, V.J., und Phillips, C.A. [2000]: Strengthening integrality gaps for capacitated network design and covering problems. Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (2000), 106–115

    Google Scholar 

  • Chan, T.M. [2018]: Approximation schemes for 0-1 knapsack. Proceedings of the 1st Symposium on Simplicity in Algorithms (2018), Artikel 5

    Google Scholar 

  • Dantzig, G.B. [1957]: Discrete variable extremum problems. Operations Research 5 (1957), 266–277

    Article  MathSciNet  Google Scholar 

  • Frieze, A.M. und 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–109

    Article  MathSciNet  Google Scholar 

  • Garey, M.R., und Johnson, D.S. [1978]: Strong NP-completeness results: motivation, examples, and implications. Journal of the ACM 25 (1978), 499–508

    Article  MathSciNet  Google Scholar 

  • Gens, G.V., und Levner, E.V. [1979]: Computational complexity of approximation algorithms for combinatorial problems. In: Mathematical Foundations of Computer Science; LNCS 74 (J. Becvar, Hrsg.), Springer, Berlin 1979, pp. 292–300

    Chapter  Google Scholar 

  • Ibarra, O.H., und Kim, C.E. [1975]: Fast approximation algorithms for the knapsack and sum of subset problem. Journal of the ACM 22 (1975), 463–468

    Article  MathSciNet  Google Scholar 

  • Karp, R.M. [1972]: Reducibility among combinatorial problems. In: Complexity of Computer Computations (R.E. Miller, J.W. Thatcher, Hrsg.), Plenum Press, New York 1972, pp. 85–103

    Chapter  Google Scholar 

  • Kellerer, H., und Pferschy, U. [2004]: Improved dynamic programming in connection with an FPTAS for the knapsack problem. Journal on Combinatorial Optimization 8 (2004), 5–11

    Article  MathSciNet  Google Scholar 

  • Kellerer, H., Pferschy, U., und Pisinger, D. [2004]: Knapsack Problems. Springer, Berlin 2004

    Google Scholar 

  • Korte, B., und Schrader, R. [1981]: On the existence of fast approximation schemes. In: Nonlinear Programming; Vol. 4 (O. Mangaserian, R.R. Meyer, S.M. Robinson, Hrsg.), Academic Press, New York 1981, pp. 415–437

    Google Scholar 

  • Lawler, E.L. [1979]: Fast approximation algorithms for knapsack problems. Mathematics of Operations Research 4 (1979), 339–356

    Article  MathSciNet  Google Scholar 

  • Nemhauser, G.L., und Ullmann, Z. [1969]: Discrete dynamic programming and capital allocation. Management Science 15 (1969), 494–505

    Article  MathSciNet  Google Scholar 

  • Pisinger, D. [1999]: Linear time algorithms for knapsack problems with bounded weights. Journal of Algorithms 33 (1999), 1–14

    Article  MathSciNet  Google Scholar 

  • Sahni, S. [1975]: Approximate algorithms for the 0/1 knapsack problem. Journal of the ACM 22 (1975), 115–124

    Article  MathSciNet  Google Scholar 

  • Vygen, J. [1997]: The two-dimensional weighted median problem. Zeitschrift für Angewandte Mathematik und Mechanik 77 (1997), Supplement, S433–S436

    Google Scholar 

  • 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–74

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Forschungsinstitut für Diskrete Mathematik, Universität Bonn, Bonn, Deutschland

    Bernhard Korte & Jens Vygen

Authors
  1. Bernhard Korte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jens Vygen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bernhard Korte .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer-Verlag GmbH Deutschland, ein Teil von Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Korte, B., Vygen, J. (2018). Das Knapsack-Problem. In: Kombinatorische Optimierung. Masterclass. Springer Spektrum, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-57691-5_17

Download citation

Publish with us

Policies and ethics

Search

Navigation