Reduced-size formulations for metric and cut polyhedra in sparse graphs
From MaRDI portal
Publication:4565778
Recommendations
- Improved compact formulations for metric and cut polyhedra
- scientific article; zbMATH DE number 665696
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results
- An effective compact formulation of the max cut problem on sparse graphs
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
Cited in
(3)
This page was built for publication: Reduced-size formulations for metric and cut polyhedra in sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4565778)