On semidefinite programming relaxations of maximum k -section
We derive a new semidefinite programming bound for the maximum k -section problem. For k=2 (i.e. for maximum bisection), the new bound is at least as strong as a well-known bound by Poljak and Rendl (SIAM J Optim 5(3):467–487, 1995). For k≥3 the new bound dominates a bound of Karisch and Rendl...
Saved in:
Main Authors: | Klerk, Etienne de., Pasechnik, Dmitrii V., Sotirov, Renata., Dobre, Cristian. |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/97683 http://hdl.handle.net/10220/11138 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
On semidefinite programming relaxations of the traveling salesman problem
by: De Klerk, Etienne., et al.
Published: (2009) -
Numerical block diagonalization of matrix - algebras with application to semidefinite programming
by: Klerk, Etienne de., et al.
Published: (2012) -
Reduction of symmetric semidefinite programs using the regular representation
by: Klerk, Etienne de., et al.
Published: (2012) -
Approximation of the stability number of a graph via copositive programming
by: Klerk, Etienne de., et al.
Published: (2011) -
A linear programming reformulation of the standard quadratic optimization problem
by: Klerk, Etienne de., et al.
Published: (2013)