Max cut and semidefinite rank
Year of publication: |
2024
|
---|---|
Authors: | Mirka, Renee ; Williamson, David P. |
Published in: |
Operations research letters : a journal of INFORMS devoted to the rapid publication of concise contributions in operations research. - Amsterdam [u.a.] : Elsevier Science, ISSN 0167-6377, ZDB-ID 1467065-3. - Vol. 53.2024, Art.-No. 107067, p. 1-5
|
Subject: | Graphs | Matrix rank | Max cut | Semidefinite programming | Mathematische Optimierung | Mathematical programming | Ranking-Verfahren | Ranking method | Graphentheorie | Graph theory |
-
Characterizing polytopes in the 0/1-cube with bounded Chvátal-Gomory rank
Benchetrit, Yohann, (2018)
-
Supermodularity in unweighted graph optimization I : branchings and matchings
Bérczi, Kristóf, (2018)
-
Supermodularity in unweighted graph optimization II : matroidal term rank augmentation
Bérczi, Kristóf, (2018)
- More ...
-
Deterministic pivoting algorithms for constrained ranking and clustering problems
Zuylen, Anke van, (2009)
-
Stackelberg thresholds in network routing games or the value of altruism
Sharma, Yogeshwer, (2009)
-
Schalekamp, Frans, (2014)
- More ...