Flows over Time with Load-Dependent Transit Times

DOI10.1137/S1052623403432645MaRDI QIDQ5317544zbMATH OpenFDO

Authors Ekkehard Köhler, Martin Skutella

Publication date 16 September 2005

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

Full work available at URL https://doi.org/10.1137/S1052623403432645

zbMATH Keywords

approximation algorithmcongestiondynamic flownetwork flowtraffic routing

Mathematics Subject Classification ID

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

Recommendations

• Quickest Flows Over Time
• Mathematical Foundations of Computer Science 2004
• Approximating earliest arrival flows with flow-dependent transit times
• An FPTAS for quickest multicommodity flows with inflow-dependent transit times
• scientific article; zbMATH DE number 1947425

Cited in

(18)

• Transport by time dependent stationary flow
• Efficient contraflow algorithms for quickest evacuation planning
• Robust flows over time: models and complexity results
• An introduction to network flows over time
• Traffic Networks and Flows over Time
• scientific article; zbMATH DE number 3970464 (Why is no real title available?)
• scientific article; zbMATH DE number 1947425 (Why is no real title available?)
• Abstract flows over time: a first step towards solving dynamic packing problems
• A critical survey on the network optimization algorithms for evacuation planning problems
• Mathematical Foundations of Computer Science 2004
• 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
• Inflow-dependent quickest multi-commodity flow problem with partial lane reversals
• Minimum-peak-cost flows over time
• Mixed-integer programming models and heuristic algorithms for the maximum value dynamic network flow scheduling problem
• Network restructuring for dynamic flow improvement
• Approximating earliest arrival flows with flow-dependent transit times

This page was built for publication: Flows over Time with Load-Dependent Transit Times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317544)