A branch bound method for subset sum problem

DOI10.1007/BF02006860zbMath0816.90115MaRDI QIDQ1343509

Shiquan Wu

Publication date: 19 January 1995

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

interior point methodconvex envelopeNP-complete problemnonconvex quadratic programsubset sum problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A unified view of interior point methods for linear programming
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• Geometric algorithms and combinatorial optimization
• Some NP-complete problems in quadratic and nonlinear programming
• Convergent Algorithms for Minimizing a Concave Function
• Feature Article—The Ellipsoid Method: A Survey
• The Indefinite Quadratic Programming Problem

This page was built for publication: A branch bound method for subset sum problem