Flows over Time with Load-Dependent Transit Times

DOI10.1137/S1052623403432645zbMath1097.90009MaRDI QIDQ5317544

Ekkehard Köhler, Martin Skutella

Publication date: 16 September 2005

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

zbMATH Keywords

approximation algorithmcongestionnetwork flowtraffic routingdynamic flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Traffic problems in operations research (90B20) Approximation algorithms (68W25)

Related Items

Efficient contraflow algorithms for quickest evacuation planning ⋮ Dynamic flows with time-dependent capacities ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ Nash equilibria and the price of anarchy for flows over time ⋮ Unnamed Item ⋮ Robust flows over time: models and complexity results ⋮ Traffic Networks and Flows over Time