Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm (Q1779531)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm |
scientific article; zbMATH DE number 2173272
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm |
scientific article; zbMATH DE number 2173272 |
Statements
Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm (English)
0 references
1 June 2005
0 references
Combinatorial optimization
0 references
NP-hard
0 references
Zero-one
0 references
Quadratic programming
0 references
Zonotope
0 references
Vertex enumeration
0 references
0 references
0 references
0.86333036
0 references
0 references
0.86141896
0 references
0.8580945
0 references
0.8559695
0 references
0.8556162
0 references
0.8555743
0 references
0 references
0.85498255
0 references
