On max-flow min-cut and integral flow properties for multicommodity flows in directed networks
From MaRDI portal
Publication:1262198
DOI10.1016/0020-0190(89)90087-2zbMath0685.90039OpenAlexW2085443931MaRDI QIDQ1262198
Hiroshi Nagamochi, Toshihide Ibaraki
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90087-2
max-flow min-cut propertydirected networksmulticommodity flow problemflow conservationintegral flow propertyside capacity constraint
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (3)
Cut-sufficient directed 2-commodity multiflow topologies ⋮ Unnamed Item ⋮ On max-flow min-cut and integral flow properties for multicommodity flows in directed networks
Cites Work
- Unnamed Item
- Unnamed Item
- A dual version of Tardos's algorithm for linear programming
- A new polynomial-time algorithm for linear programming
- Multicommodity flows in planar graphs
- On max-flow min-cut and integral flow properties for multicommodity flows in directed networks
- Multicommodity flows in graphs
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- On Odd Cuts and Plane Multicommodity Flows
This page was built for publication: On max-flow min-cut and integral flow properties for multicommodity flows in directed networks