On the \(k\)-cut subgraph polytope
type: Item
instance of: scholarly article
title: On the \(k\)-cut subgraph polytope
zbMATH Open document ID: 0820.90042
DOI: 10.1007/BF01582217
author: Kalyan Talluri
author: Donald K. Wagner
published in: Mathematical Programming. Series A. Series B
publication date: 1994-12-11T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B25
Mathematics Subject Classification ID: 52B12
zbMATH DE Number: 700818
zbMATH Keywords: minimum cut
zbMATH Keywords: reliability
zbMATH Keywords: minimum-cost set of \(k\) pairwise-disjoint \((s,t)\)-cuts in a graph
zbMATH Keywords: polyhedral interpretations
MaRDI profile type: Publication
cites work: Q3097395
cites work: Edge-packings of graphs and network reliability
cites work: Q3292914
cites work: Q3818127
cites work: Disjoint (s, t)‐cuts in a network
cites work: A polynomial-time simplex method for the maximum \(k\)-flow problem
full work available at URL: https://doi.org/10.1007/bf01582217
OpenAlex ID: W2030876133
description: scientific article; zbMATH DE number 700818