Skip to main content
SpringerLink
Log in

PC-oriented algorithms for the knapsack problem

  • II Mathematical Programming
  • Conference paper
  • First Online:
System Modelling and Optimization

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

  • 129 Accesses

Abstract

The paper presents branch and bound algorithms for solving 0–1 knapsack problems on personal computers. Some improvements to the existing methods are described and fixed point calculations are introduced. Results of our computational experiment are reported.

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

  • E. Balas, E. Zemel (1980), "An Algorithm for Large Zero-One Knapsack Problems", Operations Research 28, 1130–1154.

    Article  MATH  MathSciNet  Google Scholar 

  • E. Balas, R. Nauss, E. Zemel (1987), "Comment on Some Computational Results on Real 0–1 Knapsack Problems", Operations Research Letters 6, 139–140.

    Article  MATH  MathSciNet  Google Scholar 

  • G.B. Dantzig (1957), "Discrete Variable Extremum Problems", Operations Research 5, 266–277.

    MathSciNet  Google Scholar 

  • R.S. Dembo, P.L. Hammer (1980), "A Reduction Algorithm For Knapsack Problems", Methods of Operations Research 36, 49–60.

    MATH  MathSciNet  Google Scholar 

  • K. Dudziński, S. Walukiewicz (1987), "Exact Methods for the Knapsack Problem and its Generalizations", European Journal of Operational Research 28, 3–21.

    Article  MathSciNet  MATH  Google Scholar 

  • G.P. Ingargiola, J.F. Korsh (1973), "A Reduction Algorithm for Zero-One Single Knapsack Problems", Management Science 20, 460–463.

    MATH  Google Scholar 

  • S. Martello, P. Toth (1977), "An Upper Bound for the Zero-One Knapsack Problem and a Branch and Bound Algorithm", European Journal of Operational Research 1, 169–175.

    Article  MATH  MathSciNet  Google Scholar 

  • S. Martello, P. Toth (1987), "Algorithms for Knapsack Problems" in S. Martello, G. Laporte, M. Minoux and C. Ribeiro (Eds.), Surveys in Combinatorial Optimization, Annals of Discrete Mathematics 31, North-Holland, Amsterdam.

    Google Scholar 

  • S. Martello, P. Toth (1988), "A New Algorithm for the 0–1 Knapsack Problem", Management Science 34, 633–641.

    MATH  MathSciNet  Google Scholar 

  • D. Pisinger, S. Walukiewicz (1989), "Experiments with 0–1 Knapsack Algorithms", Research Report, Systems Research Institute Polish, Academy of Sciences, Warsaw.

    Google Scholar 

  • P. Toth (1980), "Dynamic Programming Algorithms for the Zero-One Knapsack Problem", Computing 25, 29–45.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Systems Research Institute, Polish Academy of Sciences, Newelska 6, 01-447, Warsaw, Poland

    Krzysztof Dudziński & Stanisław Walukiewicz

Authors
  1. Krzysztof Dudziński
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stanisław Walukiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

L. D. Davisson A. G. J. MacFarlane H. Kwakernaak J. L. Massey Ya Z. Tsypkin A. J. Viterbi Peter Kall

Rights and permissions

Reprints and permissions

Copyright information

© 1992 International Federation for Information Processing

About this paper

Cite this paper

Dudziński, K., Walukiewicz, S. (1992). PC-oriented algorithms for the knapsack problem. In: Davisson, L.D., et al. System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0113282

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55577-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation