Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network

DOI10.1006/jagm.1993.1048zbMath0795.90018OpenAlexW2044614658MaRDI QIDQ4275336

Heather Booth, Robert Endre Tarjan

Publication date: 13 January 1994

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1993.1048

zbMATH Keywords

balanced search treeseries-parallel networkminimum-cost maximum flow

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Related Items (6)

Budget-constrained minimum cost flows ⋮ Generalized max flow in series-parallel graphs ⋮ Inapproximability and a polynomially solvable special case of a network improvement problem. ⋮ The inverse 1-maxian problem with edge length modification ⋮ Inverse center location problem on a tree ⋮ The most likely path on series-parallel networks

This page was built for publication: Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network