Minimum-cost dynamic flows: The series-parallel case

DOI10.1002/NET.10112MaRDI QIDQ4474291zbMATH OpenOpenAlexFDO

Authors Bettina Klinz, Gerhard J. Woeginger

Publication date 4 August 2004

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.10112

zbMATH Keywords

dynamic network flowgreedy algorithmminimum-cost flowtwo-terminal series parallel networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

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

Cited in

(26)

• A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
• A polynomial time algorithm for the minimum flow problem in time-varying networks
• Managing high-end ex-demonstration product returns
• An exact algorithm for a multicommodity min-cost flow over time problem
• Abstract flows over time: a first step towards solving dynamic packing problems
• A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
• Multicommodity flows over time: Efficient algorithms and complexity
• A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
• Minimum-aggregate-concave-cost multicommodity flows in strong-series-parallel networks
• An introduction to network flows over time
• Earliest arrival flows on series-parallel graphs
• The most likely path on series-parallel networks
• Minimum cost paths over dynamic networks
• On solving continuous-time dynamic network flows
• A critical survey on the network optimization algorithms for evacuation planning problems
• Efficient algorithm for minimum cost flow problem with partial lane reversals
• Minimum cost dynamic flows: the series-parallel case
• Integrality in the multinetwork min‐cost equal‐flow problem
• Minimum‐cost flow problems having arc‐activation costs
• A note on the quickest minimum cost transshipment problem
• Scalable timing-aware network design via Lagrangian decomposition
• Distributionally robust chance-constrained multicommodity network flow problem in dynamic networks: a column-generation approach
• Minimum-peak-cost flows over time
• Minimum flow problem on network flows with time-varying bounds
• The minimum-cost dynamic flow problem in a fixed graph with a constant target flow value
• Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle

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 Q4474291)