Minimum-cost dynamic flows: The series-parallel case
From MaRDI portal
Publication:4474291
DOI10.1002/net.10112zbMath1053.90128OpenAlexW2066074485MaRDI QIDQ4474291
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
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (20)
Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle ⋮ Multicommodity flows over time: Efficient algorithms and complexity ⋮ Minimum cost paths over dynamic networks ⋮ A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs ⋮ 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 ⋮ An Introduction to Network Flows over Time ⋮ On solving continuous-time dynamic network flows ⋮ Unnamed Item ⋮ 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 ⋮ Minimum flow problem on network flows with time-varying bounds ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ Earliest arrival flows on series-parallel graphs ⋮ The most likely path on series-parallel networks
Cites Work
This page was built for publication: Minimum-cost dynamic flows: The series-parallel case
