Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities

DOI10.1002/net.3230180405zbMath0652.90041OpenAlexW2002958336MaRDI QIDQ3798457

Richard G. Ogier

Publication date: 1988

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

polynomial-time algorithms\(\tau\)-maximum flowminimum-delay dynamic routingPiecewise-constant link and storage capacitiessingle-source single-sink dynamic network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Related Items (7)

Approximating earliest arrival flows with flow-dependent transit times ⋮ Scheduling arc maintenance jobs in a network to maximize total flow over time ⋮ A linear programming approach to routing control in networks of constrained linear positive systems ⋮ Universally maximum flow with piecewise-constant capacities ⋮ Structural and algorithmic properties for parametric minimum cuts ⋮ Queueing networks of random link topology: stationary dynamics of maximal throughput schedules ⋮ Efficient continuous-time dynamic network flow algorithms

This page was built for publication: Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities