Improving the linear relaxation of maximum k-cut with semidefinite-based constraints
Year of publication: |
2019
|
---|---|
Authors: | Sousa, Vilmar Jefté Rodrigues de ; Anjos, Miguel F. ; Le Digabel, Sébastien |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 7.2019, 2, p. 123-151
|
Subject: | Eigenvalue constraint | Graph partitioning | Maximum k-cut | Semi-infinite formulation | Semidefinite programming | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Schätztheorie | Estimation theory |
-
Semidefinite approximations for bicliques and bi-independent pairs
Laurent, Monique, (2025)
-
Laurent, Monique, (2023)
-
Column-generation based bounds for the homogeneous areas problem
Colombo, Fabio, (2014)
- More ...
-
Computational study of valid inequalities for the maximum k-cut problem
Sousa, Vilmar Jefté Rodrigues de, (2018)
-
Anjos, Miguel F., (2020)
-
Special issue on "continuous optimization and applications in machine learning and data analytics"
Anjos, Miguel F., (2020)
- More ...