An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:51, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs |
scientific article |
Statements
An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (English)
0 references
12 November 2010
0 references
DC programming
0 references
DC algorithms (DCA)
0 references
nonconvex quadratic programming
0 references
exact penalty
0 references
DC relaxation
0 references
branch-and-bound (B\&B)
0 references
semidefinite programming (SDP)
0 references
binary quadratic programming (BQP)
0 references
