Small Min-Cut Polyhedra

DOI10.1287/moor.24.1.35zbMath0977.90068OpenAlexW2171174546MaRDI QIDQ2757581

Dimitris Alevras

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.24.1.35

zbMATH Keywords

integer programmingpolyhedramin-cut problemfacet computation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Related Items (4)

On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency ⋮ On the polyhedral structure of uniform cut polytopes ⋮ On the cut polyhedron. ⋮ Quasi-semi-metrics, oriented multi-cuts and related polyhedra

This page was built for publication: Small Min-Cut Polyhedra