On semidefinite programming relaxations of maximum \(k\)-section (Q1925786): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10107-012-0603-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2171599960 / rank | |||
Normal rank |
Revision as of 18:34, 19 March 2024
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