Minimum cost dynamic flows: The series-parallel case

DOI10.1007/3-540-59408-6_62zbMath1500.90079OpenAlexW1569442745MaRDI QIDQ5101426

Gerhard J. Woeginger, Bettina Klinz

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

greedy algorithmNP-harddynamic networkfeasible dynamic flow

Mathematics Subject Classification ID

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

Related Items (4)

A note on the quickest minimum cost transshipment problem ⋮ The Maximum Energy-Constrained Dynamic Flow Problem ⋮ Unnamed Item ⋮ One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of dynamic network flows
• Minimum cost flow algorithms for series-parallel networks
• Minimum Convex Cost Dynamic Network Flows
• A forward network simplex algorithm for solving multiperiod network flow problems
• The Recognition of Series Parallel Digraphs
• The quickest flow problem
• Maximal, Lexicographic, and Dynamic Network Flows
• Constructing Maximal Dynamic Flows from Static Flows
• An Algorithm for Universal Maximal Dynamic Flows in a Network

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