Q4875223
type: Item
instance of: scholarly article
zbMATH Open document ID: 0845.90048
author: S. Thomas McCormick
publication date: 1996-09-15T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 871948
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: max flow/min cut theorem
zbMATH Keywords: supermodular objective
MaRDI profile type: MaRDI publication profile
Recommended article: A Strongly Polynomial Algorithm for Generalized Flow Maximization
Recommended article: A strongly polynomial algorithm for generalized flow maximization
Recommended article: A faster polynomial algorithm for the constrained maximum flow problem
Recommended article: A Polynomial Algorithm for Weighted Abstract Flow
Recommended article: A simpler and faster strongly polynomial algorithm for generalized flow maximization
Recommended article: A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization
Recommended article: A strongly polynomial algorithm for the minimum maximum flow degree problem
Recommended article: Polynomial-time algorithms for special cases of the maximum confluent flow problem
Recommended article: An approximate polynomial method for solving a combinatorial problem of finding the maximum flow in a network
Recommended article: A polynomial-time simplex method for the maximum \(k\)-flow problem
description: scientific article; zbMATH DE number 871948