✦ LIBER ✦

Complexity results for the gap inequalities for the max-cut problem

✍ Scribed by Laura Galli; Konstantinos Kaparis; Adam N. Letchford

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Gap Inequalities for the Cut Polytope

✍ Monique Laurent; Svatopluk Poljak 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 437 KB

A probabilistic result for the max-cut p

✍ Amir Beck; Marc Teboulle 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 101 KB

Optimization and optimality test for the

✍ Chr Hohmann; W. Kern 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 510 KB

A discrete dynamic convexized method for

✍ Geng Lin, Wenxing Zhu 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 623 KB

The Complexity of the Matching-cut Probl

✍ Paul Bonsma 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Optimization via enumeration: a new algo

✍ Anna Galluccio; Martin Loebl; Jan Vondrák 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 163 KB