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

Journal of Computer and System Sciences

Volumn 70, Issue 1, 2005, Pages 107-117

  Zhu, Wenxing ^a  

^a FUZHOU UNIVERSITY   (China)

Author keywords

Branch and Bound; Complete enumeration; Nonconvex integer quadratic programming

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; VECTORS;

BRANCH AND BOUND; COMPLET ENUMERATION; ENUMERATION METHOD; NONCONVEX INTEGER QUADRATIC PROGRAMMING;

QUADRATIC PROGRAMMING;

EID: 9244243638     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.07.002     Document Type: Article

References (7)

1. H.P. Benson, S.S. Erenguc, R. Horst, A note on adapting methods for continuous global optimization to the discrete case, Ann. Oper. Res. 25 (1990) 243-252.
2. W. Conley, Computer Optimization Techniques, Pertrocelli Books Inc., 1980.
3. S.S. Erenguc, H.P. Benson, An algorithm for indefinite integer quadratic programming, Comput. Math. Appl. 21 (1991) 99-106.
4. M.R. Garey, D.S. Johnson, Computers and Intractability - A Guide to the Theory of NP-completeness, Freeman, New York, 1979.
5. H.P. Kunzi, W. Oettli, Integer quadratic programming, in: R.L. Graves, P. Wolfe (Eds.), Recent Advances in Mathematical Programming, McGraw Hill, New York, 1963, pp. 159-163.
6. G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
7. P.M. Pardalos, F. Rendl, H. Wolkowicz, The quadratic assignment problem: A survey and recent developments, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, 1994, pp. 1-42.