An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs
Authors:
- 10 January 2010
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 48 (4) , 595-632
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programmingOptimization Methods and Software, 2008
- Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 ProblemMathematical Programming, 2006
- The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization ProblemsAnnals of Operations Research, 2005
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization ApproachSIAM Journal on Optimization, 2003
- A Spectral Bundle Method for Semidefinite ProgrammingSIAM Journal on Optimization, 2000
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planesMathematical Programming, 1998
- A D.C. Optimization Algorithm for Solving the Trust-Region SubproblemSIAM Journal on Optimization, 1998
- A recipe for semidefinite relaxation for (0,1)-quadratic programmingJournal of Global Optimization, 1995
- On the equivalence between roof duality and Lagrangian duality for unconstrained 0–1 quadratic programming problemsDiscrete Applied Mathematics, 1994
- Computational aspects of a branch and bound algorithm for quadratic zero-one programmingComputing, 1990