A provable better Branch and Bound method for a nonconvex integer quadratic programming problem

Authors:
Wenxing Zhu
Affiliations:
Department of Computer Science and Technology, Fuzhou University, Fuzhou 350002, P. R. China
Venue:
Journal of Computer and System Sciences
Year:
2005

Citing 3
Cited 1

Integer and combinatorial optimization

Integer and combinatorial optimization
A note on adapting methods for continuous global optimization to the discrete case

Annals of Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Global optimality conditions and optimization methods for quadratic integer programming problems

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a Branch and Bound method for a nonconvex integer quadratic programming problem with a separable objective function over a bounded box. For this problem, a special branch method is constructed, which has a property that if a box has been partitioned into 2n sub-boxes, then at least one sub-box can be deleted. We analyze the complexity of the algorithm, and prove that it is better than that of the complete enumeration method in the worst case if the solution space is large enough.