Approximating Earliest Arrival Flows in Arbitrary Networks

DOI10.1007/978-3-642-33090-2_48MaRDI QIDQ2912873zbMATH OpenOpenAlexFDO

Authors Martin Groß, Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt

Publication date 25 September 2012

Published in Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33090-2_48

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Earliest arrival flows in networks with multiple sinks
• Earliest arrival flows in networks with multiple sinks
• Mathematical Foundations of Computer Science 2004
• Approximating earliest arrival flows with flow-dependent transit times
• Lexicographically optimal earliest arrival flows
• Earliest arrival flows on series-parallel graphs
• Earliest arrival transshipments in networks with multiple sinks
• Fluid limits for earliest-deadline-first networks
• Algorithms for the quickest time distribution of dynamic stochastic-flow networks
• On the Maximum Expected Flow in a Network

Cited in

(16)

• On latest starting times and floats in activity networks with ill-known durations
• Earliest-deadline-first service in heavy-traffic acyclic networks.
• A heuristic algorithm for the earliest arrival flow with multiple sources
• Earliest arrival transshipments in networks with multiple sinks
• Evacuation planning by earliest arrival contraflow
• Continuous dynamic contraflow approach for evacuation planning
• Efficient continuous contraflow algorithms for evacuation planning problems
• Approximation algorithms for the generalized incremental knapsack problem
• Earliest arrival flows in networks with multiple sinks
• Earliest arrival flows on series-parallel graphs
• Earliest Arrival Flows with Multiple Sources
• 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
• Lexicographically optimal earliest arrival flows
• Approximating earliest arrival flows with flow-dependent transit times

This page was built for publication: Approximating Earliest Arrival Flows in Arbitrary Networks

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