An efficient semidefinite programming relaxation for the graph partition problem
Year of publication: |
2014
|
---|---|
Authors: | Sotirov, Renata |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 26.2014, 1, p. 16-30
|
Subject: | graph partition | graph equipartition | matrix lifting | vector lifting | semidefinite programming | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory |
-
Lower bounds for the bandwidth problem
Rendl, Franz, (2021)
-
Partitioning through projections : strong SDP bounds for large graph partition problems
Meijer, Frank de, (2023)
-
Semidefinite approximations for bicliques and bi-independent pairs
Laurent, Monique, (2025)
- More ...
-
Salahi, Maziar, (2004)
-
The redesign of a warranty distribution network with recovery processes
Ashayeri, Jalal, (2015)
-
de Klerk, Etienne, (2007)
- More ...