On the \(k\)-cut subgraph polytope

DOI10.1007/BF01582217zbMath0820.90042OpenAlexW2030876133MaRDI QIDQ1340072

Donald K. Wagner, Kalyan T. Talluri

Publication date: 11 December 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582217

zbMATH Keywords

reliabilityminimum cutminimum-cost set of \(k\) pairwise-disjoint \((s,t)\)-cuts in a graphpolyhedral interpretations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Related Items (1)

A note on the problem of \(r\) disjoint \((s, t)\)-cuts and some related issues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial-time simplex method for the maximum \(k\)-flow problem
• Edge-packings of graphs and network reliability
• Disjoint (s, t)‐cuts in a network

This page was built for publication: On the \(k\)-cut subgraph polytope