On the integral plane two-commodity flow problem

DOI10.1016/0167-6377(92)90076-FzbMath0767.90014OpenAlexW2041532015MaRDI QIDQ1197891

Frieda Granot, Michal Penn

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90076-f

zbMATH Keywords

augmented planar graphsmaximum integral two-commodity flow problemminimal increase in the weight function

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

On the integral 4-packing of \(T\)-cuts

Cites Work

• On the planar integer two-flow problem
• A fast algorithm for maximum integral two-commodity flow in planar graphs
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• On the Complexity of Timetable and Multicommodity Flow Problems
• Unnamed Item

This page was built for publication: On the integral plane two-commodity flow problem