An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs

Tao Pham Dinh (pham@insa-rouen.fr), Nam Nguyen Canh (nguyencn@insa-rouen.fr) and Hoai An Le Thi

Journal of Global Optimization, 2010, vol. 48, issue 4, 595-632

Keywords: DC programming; DC algorithms (DCA); Nonconvex quadratic programming; Exact penalty; DC relaxation; Branch-and-bound (B&B); Semidefinite programming (SDP); Binary quadratic programming (BQP) (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10898-009-9507-y (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:48:y:2010:i:4:p:595-632

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-009-9507-y

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla (sonal.shukla@springer.com) and Springer Nature Abstracting and Indexing (indexing@springernature.com).