On the cut polyhedron.

DOI10.1016/j.disc.2002.12.001zbMath1045.90049OpenAlexW2160285134WikidataQ58002906 ScholiaQ58002906MaRDI QIDQ1426123

Michele Conforti, Laurence A. Wolsey, Giovanni Rinaldi

Publication date: 14 March 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2002.12.001

zbMATH Keywords

Rank inequalityMinimum cutCut polyhedronFacet-inducing inequality

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

On the feedback vertex set polytope of a series-parallel graph, On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency, Regular Matroids Have Polynomial Extension Complexity, On the polyhedral structure of uniform cut polytopes, On graphs of the cone decompositions for the min-cut and max-cut problems, Cut Dominants and Forbidden Minors, On the Stable Set Polytope of Claw-Free Graphs

Cites Work

• Lot-size models with backlogging: Strong reformulations and cutting planes
• On maximal independent sets of vertices in claw-free graphs
• Small Min-Cut Polyhedra
• The traveling salesman problem on a graph and some related integer polyhedra
• On the width—length inequality
• Odd Minimum Cut-Sets and b-Matchings
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
• Matching, Euler tours and the Chinese postman
• On cycle cones and polyhedra