Improved compact formulations for metric and cut polyhedra

DOI10.1016/j.endm.2016.03.017zbMath1351.90055OpenAlexW2398343076MaRDI QIDQ325413

Viet Hung Nguyen, Michel Minoux, Dang-Phuong-Lan Nguyen

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.017

zbMATH Keywords

extended formulationmaxcut problemmetric polytopetriangle inequalities

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Cites Work

• On cuts and matchings in planar graphs
• Application of cut polyhedra. I
• Applications of cut polyhedra. II
• An effective compact formulation of the max cut problem on sparse graphs
• On the cut polytope
• Extended formulations in combinatorial optimization
• Unnamed Item

This page was built for publication: Improved compact formulations for metric and cut polyhedra