On semidefinite programming relaxations of maximum \(k\)-section (Q1925786)
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: On semidefinite programming relaxations of maximum k-section |
scientific article; zbMATH DE number 6116937
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On semidefinite programming relaxations of maximum \(k\)-section |
scientific article; zbMATH DE number 6116937 |
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
0 references
0 references
0 references
0 references
0 references
0 references
