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 | Theorie | Theory | Ranking-Verfahren | Ranking method |
-
Rational and real positive semidefinite rank can be different
Fawzi, Hamza, (2016)
-
A strengthened Barvinok-Pataki bound on SDP rank
Im, Jiyoung, (2021)
-
Characterizing polytopes in the 0/1-cube with bounded Chvátal-Gomory rank
Benchetrit, Yohann, (2018)
- More ...
-
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem
Goemans, Michel X., (2000)
-
Chudak, Fabián A., (1997)
-
Two-dimensional Gantt charts and a scheduling algorithm of Lawler
GOEMANS, Michel X., (1998)
- More ...