Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm (Q1779531): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: cdd / rank | |||
Normal rank | |||
Revision as of 06:39, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm |
scientific article |
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
