A branch bound method for subset sum problem
- Cite this article as:
- Wu, S. Acta Mathematicae Applicatae Sinica (1994) 10: 302. doi:10.1007/BF02006860
- 63 Views
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.