Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986)
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: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method |
scientific article |
Statements
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (English)
0 references
23 June 2009
0 references
quadratic 0-1 programming
0 references
convex quadratic programming
0 references
semidefinite programming
0 references
densest \(k\)-subgraph
0 references
graph bisection
0 references
task allocation
0 references
experiments
0 references
