An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs - Université de Lorraine
Journal Articles Journal of Global Optimization Year : 2010

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

Domains

Computer Science [cs]

Hoai An Le Thi  : Connect in order to contact the contributor

https://hal.univ-lorraine.fr/hal-01636744

Submitted on : Thursday, November 16, 2017-10:30:02 PM

Last modification on : Friday, December 22, 2023-3:16:05 PM

Consult on ISTEX platform

Dates and versions

hal-01636744 , version 1 (16-11-2017)

Identifiers

Cite

Tao Pham Dinh, Nam Nguyen Canh, Hoai An Le Thi. An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs. Journal of Global Optimization, 2010, 48 (4), pp.595 - 632. ⟨10.1007/s10898-009-9507-y⟩. ⟨hal-01636744⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

INSA-ROUEN COMUE-NORMANDIE UNIV-LORRAINE LMI-ROUEN INSA-GROUPE
34 View
0 Download

Altmetric

Share

More