Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:13, 30 January 2024
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
