An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10898-009-9507-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2078721614 / rank | |||
Normal rank | |||
Revision as of 18:55, 19 March 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
