Skip to main content
SpringerLink
Log in

Efficient method applying incomplete ordering for solving the binary knapsack problem

  • 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. Balas, E. and Zemel, E. "Solving large zero-one knapsack problems", Management Sciences Research Report No. 408 R Carnegie-Mellon University /1977/

    Google Scholar 

  2. Fayard, D. and Plateau, G. "Techniques de resolution du Probleme du Knapsack en variables bivalents". Bulletin de la Direction des Etudes et Recherches E.D.F. Serie C, No.1. /1976/

    Google Scholar 

  3. Fayard, D.and Plateau, G. "Techniques de resoltuion du probleme du knapsack en variables bivalentes: partie 3" Publications no 91 du Laboratoire de Calcul de l'Université des Sciences et Techniques de Lille /1977/

    Google Scholar 

  4. Geoffrion, A.M. "Lagrangean Relaxation for Integer Programming", Mathematical Programming Study 2 /1974/ 82–114.

    Google Scholar 

  5. Greenberg, H.and Hegerich, R.L. "A branch search algorithm for the knapsack problem", Management Science 16/5/ /1970/ 327–332.

    Google Scholar 

  6. Ingargiola, G.P. and Korsh, J.F. "Reduction algorithm for zero-one single knapsack problems", Management Science 20/4/ /1973/ 460–463.

    Google Scholar 

  7. Lauriere, M. "An algorithm for the 0–1 knapsack Problem", Mathematical Programming 14 /1978/ 1–10.

    Google Scholar 

  8. Nauss, R.M. "An efficient algorithm for the 0–1 knapsack problem" Management Science 23 /1/ /1976/ 27–31

    Google Scholar 

  9. Suhl, U., "An algorithm and efficient data structures for the binary knapsack problem", European Journal of Operational Research 2/1978/ 420–428.

    Google Scholar 

  10. Zoltners, A.A, "A direct descent binary knapsack algorithm" Journal of the Association for Computing Machinery, 25/2/ /1978/ 304–311.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer and Automation Institute Hungarian Academy of Sciences, Kende u. 13, 1111, Budapest, Hungary

    Miklós Biró

Authors
  1. Miklós Biró
    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

Biró, M. (1980). Efficient method applying incomplete ordering for solving the binary knapsack problem. 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/BFb0006600

Download citation

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

  • 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