An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs - Université de Lorraine Accéder directement au contenu
Article Dans Une Revue Journal of Global Optimization Année : 2010

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

Dates et versions

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

Identifiants

Citer

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⟩
32 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More