On semidefinite programming relaxations of maximum \(k\)-section (Q1925786)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On semidefinite programming relaxations of maximum \(k\)-section |
scientific article |
Statements
On semidefinite programming relaxations of maximum \(k\)-section (English)
0 references
19 December 2012
0 references
The authors revisit semidefinite programming (SDP) relaxations for the maximum \(k\)-section problem, a classical problem of combinatorial optimization. They rely upon a previous SDP relaxation proposed by two of the authors for the quadratic assignment problem. By performing symmetry reduction, they show that the new SDP bound can be obtained more efficiently.
0 references
graph theory
0 references
combinatorial optimization
0 references
