A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems - Université de Lorraine
Journal Articles Journal of Global Optimization Year : 1998

A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems

Domains

Computer Science [cs]

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

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

Submitted on : Thursday, November 16, 2017-11:31:33 PM

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

Consult on ISTEX platform

Dates and versions

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

Identifiers

Cite

Hoai An Le Thi, Tao Pham Dinh. A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems . Journal of Global Optimization, 1998, 13 (2), pp.171 - 206. ⟨10.1023/A:1008240227198⟩. ⟨hal-01636780⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

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

Altmetric

Share

More