Quickest Flows Over Time

DOI10.1137/S0097539703427215zbMath1146.90014OpenAlexW2008133042MaRDI QIDQ5432363

Publication date: 3 January 2008

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

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

zbMATH Keywords

network flows dynamic flows earliest arrival flows quickest flows

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 (43)

Earliest Arrival Flows in Networks with Multiple Sinks ⋮ Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\) ⋮ Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle ⋮ Minmax regret for sink location on dynamic flow paths with general capacities ⋮ Layered graph approaches for combinatorial optimization problems ⋮ Multicommodity flows over time: Efficient algorithms and complexity ⋮ Dynamic multicommodity contraflow problem with asymmetric transit times ⋮ Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation ⋮ A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ On Verifying and Maintaining Connectivity of Interval Temporal Networks ⋮ The complexity of optimal design of temporally connected graphs ⋮ Unnamed Item ⋮ Lexicographically optimal earliest arrival flows ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ A note on the quickest minimum cost transshipment problem ⋮ Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows ⋮ Scalable timing-aware network design via Lagrangian decomposition ⋮ Temporal flows in temporal networks ⋮ Distributed computing with the Cloud ⋮ The Maximum Energy-Constrained Dynamic Flow Problem ⋮ An Introduction to Network Flows over Time ⋮ Unnamed Item ⋮ A simplex based algorithm to solve separated continuous linear programs ⋮ A polynomial time algorithm for the minimum flow problem in time-varying networks ⋮ Computational complexity of convoy movement planning problems ⋮ Earliest arrival flows in networks with multiple sinks ⋮ An exact algorithm for a multicommodity min-cost flow over time problem ⋮ Universal Packet Routing with Arbitrary Bandwidths and Transit Times ⋮ Flows over time in time-varying networks: optimality conditions and strong duality ⋮ An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths ⋮ A heuristic algorithm for the earliest arrival flow with multiple sources ⋮ A tight bound on the speed-up through storage for quickest multi-commodity flows ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ A Stackelberg strategy for routing flow over time ⋮ A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems ⋮ The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths ⋮ A simplex-type algorithm for continuous linear programs with constant coefficients ⋮ Earliest arrival flows on series-parallel graphs ⋮ Traffic Networks and Flows over Time ⋮ Optimal Evacuation Solutions for Large-Scale Scenarios ⋮ Heterogeneous multi-commodity network flows over time ⋮ Bounding Residence Times for Atomic Dynamic Routings

This page was built for publication: Quickest Flows Over Time