Approximating earliest arrival flows with flow-dependent transit times

DOI10.1016/J.DAM.2006.04.030MaRDI QIDQ867858zbMATH OpenOpenAlexFDO

Authors Nadine Baumann, Ekkehard Köhler

Publication date 19 February 2007

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2006.04.030

zbMATH Keywords

dynamic flowsearliest arrival flowsflows over timeoptimization

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Mathematical Foundations of Computer Science 2004
• Approximating Earliest Arrival Flows in Arbitrary Networks
• Flows over Time with Load-Dependent Transit Times
• scientific article; zbMATH DE number 1947425
• Earliest arrival flows in networks with multiple sinks

Cites work

• A bad network problem for the simplex method and other minimum cost flow algorithms
• An Algorithm for Universal Maximal Dynamic Flows in a Network
• An FPTAS for quickest multicommodity flows with inflow-dependent transit times
• Constructing maximal dynamic flows from static flows
• scientific article; zbMATH DE number 1714716 (Why is no real title available?)
• scientific article; zbMATH DE number 1714717 (Why is no real title available?)
• scientific article; zbMATH DE number 1003275 (Why is no real title available?)
• scientific article; zbMATH DE number 1342127 (Why is no real title available?)
• scientific article; zbMATH DE number 1947425 (Why is no real title available?)
• scientific article; zbMATH DE number 2079322 (Why is no real title available?)
• scientific article; zbMATH DE number 2119659 (Why is no real title available?)
• scientific article; zbMATH DE number 871909 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• Maximal, Lexicographic, and Dynamic Network Flows
• Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
• Transient flows in networks

Cited in

(14)

• Efficient contraflow algorithms for quickest evacuation planning
• A heuristic algorithm for the earliest arrival flow with multiple sources
• A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
• Approximating Earliest Arrival Flows in Arbitrary Networks
• Earliest Arrival Flows with Multiple Sources
• Traffic Networks and Flows over Time
• scientific article; zbMATH DE number 1947425 (Why is no real title available?)
• Earliest arrival flows in networks with multiple sinks
• A critical survey on the network optimization algorithms for evacuation planning problems
• Mathematical Foundations of Computer Science 2004
• Flows over Time with Load-Dependent Transit Times
• Temporally repeated maximum dynamic flow with intermediate storage
• Network restructuring for dynamic flow improvement
• Maximum dynamic FlowLoc with intermediate storage: a temporally repeated approach

This page was built for publication: Approximating earliest arrival flows with flow-dependent transit times

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