A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems
Authors:
- 1 September 1998
- journal article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 13 (2) , 171-206
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- A new algorithm for solving the general quadratic programming problemComputational Optimization and Applications, 1996
- A recipe for semidefinite relaxation for (0,1)-quadratic programmingJournal of Global Optimization, 1995
- A finite algorithm for solving general quadratic problemsJournal of Global Optimization, 1994
- Geometric Algorithms and Combinatorial Optimization1993
- Global Optimization1993
- On affine scaling algorithms for nonconvex quadratic programmingMathematical Programming, 1992
- A continuous approach to inductive inferenceMathematical Programming, 1992
- A continuous method for computing bounds in integer quadratic optimization problemsJournal of Global Optimization, 1992
- Polyhedral annexaton, dualization and dimension reduction technique in global optimizationJournal of Global Optimization, 1991
- Global minimization of large-scale constrained concave quadratic problems by separable programmingMathematical Programming, 1986