Skip to main content
SpringerLink
Log in

Fast approximation algorithms for knapsack type problems

  • Integer Programming
  • Conference paper
  • First Online:
Optimization Techniques

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 23))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Babat, L.G. Linear functions on the N-dimensional unit cube. Dokl. Akad. Nauk SSSR 222, 761–762 (1975) (Russian).

    Google Scholar 

  2. Dinic, E.A., and Karzanov, A.V. A Boolean optimization problem. Preprint, Moscow, VNIISI, 1978 (Russian).

    Google Scholar 

  3. Garey, M.R., and Johnson, D.S. Approximation algorithms for combinatorial problems. In Algorithms and Complexity, Acad. Press, NY., 1976

    Google Scholar 

  4. Gens, G.V., and Levner, E.V. Approximation algorithms for scheduling problems. Izv. Akad. Nauk SSSR, Tehn. Kibernet. 6, 38–43 (1978)

    Google Scholar 

  5. Gens, G.V., and Levner, E.V. Complexity of approximation algorithms. Lecture Notes in Computer Science 74, Springer Verlag (1979)

    Google Scholar 

  6. Ibarra, O.H., and Kim, C.E. Fast approximation algorithms for knapsack and sum of subset problems. J. ACM 22, 463–468 (1975).

    Google Scholar 

  7. Kannan, R., and Korte B. Approximative combinatorial algorithms. Report WR 78107-OR, Institute of Operat. Research, Bonn, 1978.

    Google Scholar 

  8. Lawler, E.L. Fast approximation algorithms for knapsack problems. Memo. No UCB/ERL M77/45, Univ. of California, Berkeley, 1977.

    Google Scholar 

  9. Levner, E.V., and Gens, G.V. Discrete Optimization Problems and Approximation Algorithms. Moscow, CEMI (1978) (Russian)

    Google Scholar 

  10. Sahni, S. Algorithms for scheduling independent tasks. J. ACM 23, 114–127 (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Central Economic and Mathematical Institute, USSR Academy of Sciences, 117333, Moscow

    G. V. Gens & E. V. Levner

Authors
  1. G. V. Gens
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. V. Levner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. Iracki K. Malanowski S. Walukiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag

About this paper

Cite this paper

Gens, G.V., Levner, E.V. (1980). Fast approximation algorithms for knapsack type problems. In: Iracki, K., Malanowski, K., Walukiewicz, S. (eds) Optimization Techniques. Lecture Notes in Control and Information Sciences, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006603

Download citation

  • DOI: https://doi.org/10.1007/BFb0006603

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10081-2

  • Online ISBN: 978-3-540-38253-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation