Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10107-005-0637-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10107-005-0637-9 / rank | |||
Normal rank | |||
Latest revision as of 06:11, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem |
scientific article |
Statements
Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (English)
0 references
5 March 2007
0 references
integer programming
0 references
quadratic 0-1 optimization
0 references
convex quadratic relaxation
0 references
semidefinite positive relaxation
0 references
experiments
0 references
max-cut
0 references
0 references
0 references
0 references
