Negative circuits for flows and submodular flows

DOI10.1016/0166-218X(92)90231-XzbMath0774.90029OpenAlexW1968473743MaRDI QIDQ1192951

Uwe T. Zimmermann

Publication date: 27 September 1992

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

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90231-x

zbMATH Keywords

minimum cost flowsubmodular flownegative circuit method

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (2)

A fast cost scaling algorithm for submodular flow ⋮ A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows

Cites Work

• Minimization on submodular flows
• Geometric algorithms and combinatorial optimization
• A PRIMAL ALGORITHM FOR THE SUBMODULAR FLOW PROBLEM WITH MINIMUM-MEAN CYCLE SELECTION
• A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems
• Combinatorial Optimization with Rational Objective Functions
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• A PRIMAL APPROACH TO THE INDEPENDENT ASSIGNMENT PROBLEM
• ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Negative circuits for flows and submodular flows