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

DOI10.1006/JAGM.1993.1048MaRDI QIDQ4275336zbMATH OpenOpenAlexFDO

Authors Heather Booth, Robert E. 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 treeminimum-cost maximum flowseries-parallel network

Mathematics Subject Classification ID

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

Recommendations

• Minimum cost flow algorithms for series-parallel networks
• scientific article; zbMATH DE number 3864952
• Finding minimum-cost flows by double scaling
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A new approach to the maximum-flow problem

Cited in

(16)

• Minimum cost flow algorithms for series-parallel networks
• Greedy concepts for network flow problems
• The parallel computation of minimum cost paths in graphs by stream contraction
• Parametric max flow problems in a class of networks with series-parallel structure
• Inapproximability and a polynomially solvable special case of a network improvement problem.
• Generalized max flow in series-parallel graphs
• Budget-constrained minimum cost flows
• The most likely path on series-parallel networks
• scientific article; zbMATH DE number 3864952 (Why is no real title available?)
• Minimum-cost dynamic flows: The series-parallel case
• Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources
• Efficient algorithm for minimum cost flow problem with partial lane reversals
• Minimum cost dynamic flows: the series-parallel case
• A near-linear time algorithm and a min-cost flow approach for determining the optimal landing times of a fixed sequence of planes
• Inverse center location problem on a tree
• The inverse 1-maxian problem with edge length modification

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

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