On the Quickest Flow Problem in Dynamic Networks – A Parametric Min-Cost Flow Approach
From MaRDI portal
Publication:5363108
DOI10.1137/1.9781611973730.89zbMath1372.68212OpenAlexW4256413428MaRDI QIDQ5363108
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/100441
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Flows in graphs (05C21)
Related Items
Efficient contraflow algorithms for quickest evacuation planning, The mixed evacuation problem, DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS, A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem, A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs, Algorithms for the quickest time distribution of dynamic stochastic-flow networks, Dynamic network flow location models and algorithms for quickest evacuation planning, Approximation algorithms for the generalized incremental knapsack problem, Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach, Unnamed Item, Unnamed Item, Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks, Improved algorithms for the evacuation route planning problem, A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem, Efficient algorithms for abstract flow with partial switching, Discrete Newton methods for the evacuation problem
