An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs
| Year of publication: |
2010
|
|---|---|
| Authors: | Dinh, Tao Pham ; Canh, Nam Nguyen ; Thi, Hoai Le |
| Published in: |
Journal of Global Optimization. - Springer. - Vol. 48.2010, 4, p. 595-632
|
| Publisher: |
Springer |
| Subject: | DC programming | DC algorithms (DCA) | Nonconvex quadratic programming | Exact penalty | DC relaxation | Branch-and-bound (B&B) | Semidefinite programming (SDP) | Binary quadratic programming (BQP) |
-
Exact penalty and error bounds in DC programming
Thi, Hoai Le, (2012)
-
A combined DCA: GA for constructing highly nonlinear balanced boolean functions in cryptography
Le, Hoai, (2010)
-
Hoai An Le Thi, (2020)
- More ...
-
A DC programming approach for feature selection in support vector machines learning
Thi, Hoai Le, (2008)
-
Dinh, Tao Pham, (2011)
-
Properties of two DC algorithms in quadratic programming
Thi, Hoai Le, (2011)
- More ...