scientific article; zbMATH DE number 871948

zbMATH Open0845.90048MaRDI QIDQ4875223FDOQ4875223

S. Thomas McCormick

Publication date: 15 September 1996

Title of this publication is not available (Why is that?)

zbMATH Keywords

polynomial algorithmmax flow/min cut theoremsupermodular objective

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (13)

• Decomposition of probability marginals for security games in abstract networks
• Protection of flows under targeted attacks
• Title not available (Why is that?)
• Abstract flows over time: a first step towards solving dynamic packing problems
• A faster polynomial algorithm for the constrained maximum flow problem
• On maximum flows in polyhedral domains
• A Polynomial Algorithm for Weighted Abstract Flow
• A strongly polynomial algorithm for generalized flow maximization
• A Primal-Dual Algorithm for Weighted Abstract Cut Packing
• Efficient continuous contraflow algorithms for evacuation planning problems
• Efficient algorithms for abstract flow with partial switching
• Abstract network flow with intermediate storage for evacuation planning
• Partial contraflow with path reversals for evacuation planning

Recommendations

• A Strongly Polynomial Algorithm for Generalized Flow Maximization 👍 👎
• A simpler and faster strongly polynomial algorithm for generalized flow maximization 👍 👎
• A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization 👍 👎
• A strongly polynomial algorithm for generalized flow maximization 👍 👎
• A polynomial-time simplex method for the maximum \(k\)-flow problem 👍 👎
• A faster polynomial algorithm for the constrained maximum flow problem 👍 👎
• A Polynomial Algorithm for Weighted Abstract Flow 👍 👎
• Polynomial-time algorithms for special cases of the maximum confluent flow problem 👍 👎
• An approximate polynomial method for solving a combinatorial problem of finding the maximum flow in a network 👍 👎
• A strongly polynomial algorithm for the minimum maximum flow degree problem 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875223)