Quickest Flows Over Time

DOI10.1137/S0097539703427215zbMath1146.90014MaRDI QIDQ5432363

Lisa K. Fleischer, Martin Skutella

Publication date: 3 January 2008

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

network flows; dynamic flows; earliest arrival flows; quickest flows

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

90B10: Deterministic network models in operations research

90C27: Combinatorial optimization

90B20: Traffic problems in operations research

68W25: Approximation algorithms

Related Items

A simplex based algorithm to solve separated continuous linear programs, Multicommodity flows over time: Efficient algorithms and complexity, The Maximum Energy-Constrained Dynamic Flow Problem