Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
From MaRDI portal
Publication:3798457
DOI10.1002/net.3230180405zbMath0652.90041MaRDI QIDQ3798457
Publication date: 1988
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230180405
polynomial-time algorithms; \(\tau\)-maximum flow; minimum-delay dynamic routing; Piecewise-constant link and storage capacities; single-source single-sink dynamic network
68Q25: Analysis of algorithms and problem complexity
90B10: Deterministic network models in operations research
Related Items
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, Structural and algorithmic properties for parametric minimum cuts, Approximating earliest arrival flows with flow-dependent transit times, Efficient continuous-time dynamic network flow algorithms, Queueing networks of random link topology: stationary dynamics of maximal throughput schedules, Universally maximum flow with piecewise-constant capacities