Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5131059
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem |
scientific article; zbMATH DE number 5131059 |
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
0.8208677768707275
0 references
0.793987512588501
0 references
0.7892419695854187
0 references
0.7801641225814819
0 references
