scientific article; zbMATH DE number 2079322

zbMath1094.90511MaRDI QIDQ4471275

Lisa K. Fleischer, Martin Skutella

Publication date: 28 July 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Related Items

Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle ⋮ Scheduling algorithms for procrastinators ⋮ Multicommodity flows over time: Efficient algorithms and complexity ⋮ Uniform resource networks. I: Complete graphs ⋮ Approximating earliest arrival flows with flow-dependent transit times ⋮ A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs ⋮ An Introduction to Network Flows over Time ⋮ Computational complexity of convoy movement planning problems ⋮ An exact algorithm for a multicommodity min-cost flow over time problem ⋮ Universal Packet Routing with Arbitrary Bandwidths and Transit Times ⋮ Abstract flows over time: a first step towards solving dynamic packing problems ⋮ Traffic Networks and Flows over Time ⋮ Asymmetrical resource networks. I. Stabilization processes for low resources ⋮ Minimum-cost dynamic flows: The series-parallel case ⋮ Heterogeneous multi-commodity network flows over time