Skip to main content
SpringerLink
Log in

A branch bound method for subset sum problem

  • Published:
Acta Mathematicae Applicatae Sinica Aims and scope Submit manuscript

Abstract

This paper indicates the possible difficulties for applying the interior point method to NP-complete problems, transforms an NP-complete problem into a nonconvex quadratic program and then develops some convexity theories for it. Lastly it proposes an algorithm which uses Karmarkar's algorithm as a subroutine. The finite convergence of this algorithm is also proved.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. L.G. Khachiyan. A Polynomial Algorithm for Linear Programming.Doklady Akad. Nauk USSR, 1979, 244 (5): 1093–1096, Translated inSoviet Math. Doklady, 1979, 191–194.

    MATH  MathSciNet  Google Scholar 

  2. N. Karmarkar. A New Polynomial-time Algorithm For Linear Programming.Combinatorica, 1984, 4 (4): 372–375.

    MathSciNet  Google Scholar 

  3. N. Karmarkar. An Interior Point Approach to NP-Complete Problems (Extended Abstract). AT & T Bell Laboratories, Murray Hill, New Jersey 07974.

  4. M.R. Garey and D.S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness, Freeman, New York, 1980.

    Google Scholar 

  5. Paul F. Kough. The Indefinite Quadratic Programming Problem.Operations Research, 1979, 27 (3): 516–533.

    MATH  MathSciNet  Google Scholar 

  6. Nguyen Van Thoai and Hoang Tuy. Convergent Algorithms for Minimizing A Concave Function.Mathematics of Operation Research, 1980, 5 (4): 556–566.

    Article  MATH  Google Scholar 

  7. Katta C. Murty and Santosh N. Kabadi. Some NP-Complete Problems in Quadratic and Nonlinear Programming.Mathematical Programming, 1980, 39: 117–129.

    MathSciNet  Google Scholar 

  8. Yinyu Ye and Edison Tse. An Extension of Karmarkar's Projective Algorithm for Convex Quadratic Programming.Mathematical Programming, 1989, 44: 157–179.

    Article  MATH  MathSciNet  Google Scholar 

  9. R.T. Rockafellar. Convex Analysis. Princeton University Press, Princeton, N.J. 1969.

    Google Scholar 

  10. Martin Grötschel, Lázló Lovász and Alexander Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 1988.

  11. A. Schrijver. Theory of Linear and Integer Programming. Wiley-Interscience, New York, 1986.

    MATH  Google Scholar 

  12. Robert G. Bland, D. Goldfarb and M.J. Todd. The Ellipsoid Method: A Survey.Operations Research, 1981, 29 (6): 1039–1091.

    MATH  MathSciNet  Google Scholar 

  13. Kâscku Yosida. Functional Analysis. Springer-Verlag, New York, 1971.

    MATH  Google Scholar 

  14. M. Padberg and G. Rinaldi. A Branch and Cut Algorithm for the Resolution of Large Scale Symmetric Traveling Salesman Problems. Ecole Polytechnique, Laboratoire d'Econométrie, No. 319, 1989.

  15. D.F. Shanno and Ansuman Bagchi. An Unified View of Interior Point Methods for Linear Programming. Rutcor, Rutgers University, New Brunswick, NJ08903, 1988.

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, the Chinese Academy of Sciences, 100080, Beijing, China

    Wu Shiquan

Authors
  1. Wu Shiquan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The whole paper was completed while the author was studying in the laboratoire d'économétrie de l'Ecole Polytechnique, Paris, France.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, S. A branch bound method for subset sum problem. Acta Mathematicae Applicatae Sinica 10, 302–314 (1994). https://doi.org/10.1007/BF02006860

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation