Minimum cost dynamic flows: the series-parallel case

DOI10.1007/3-540-59408-6_62MaRDI QIDQ5101426zbMATH OpenOpenAlexFDO

Authors Bettina Klinz, Gerhard J. Woeginger

Publication date 30 August 2022

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59408-6_62

zbMATH Keywords

dynamic networkfeasible dynamic flowgreedy algorithmNP-hard

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Minimum-cost dynamic flows: The series-parallel case
• Minimum cost flow algorithms for series-parallel networks
• scientific article; zbMATH DE number 1918689
• Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network
• scientific article; zbMATH DE number 1984104

Cites work

• A forward network simplex algorithm for solving multiperiod network flow problems
• A survey of dynamic network flows
• An Algorithm for Universal Maximal Dynamic Flows in a Network
• Constructing maximal dynamic flows from static flows
• scientific article; zbMATH DE number 1003275 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 910909 (Why is no real title available?)
• scientific article; zbMATH DE number 956788 (Why is no real title available?)
• Maximal, Lexicographic, and Dynamic Network Flows
• Minimum Convex Cost Dynamic Network Flows
• Minimum cost flow algorithms for series-parallel networks
• The quickest flow problem
• The Recognition of Series Parallel Digraphs

Cited in

(9)

• Minimum cost flow algorithms for series-parallel networks
• One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
• Minimum cost multi-product flow lines
• Minimum-aggregate-concave-cost multicommodity flows in strong-series-parallel networks
• The Maximum Energy-Constrained Dynamic Flow Problem
• Minimum-cost dynamic flows: The series-parallel case
• A critical survey on the network optimization algorithms for evacuation planning problems
• A note on the quickest minimum cost transshipment problem
• One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs

This page was built for publication: Minimum cost dynamic flows: the series-parallel case

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