Reliable and Restricted Quickest Path Problems
From MaRDI portal
Publication:3091515
DOI10.1007/978-3-642-21527-8_36zbMath1345.90020OpenAlexW2101853061MaRDI QIDQ3091515
Markus Thiemann, Stefan Ruzika
Publication date: 9 September 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2288
Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)
Related Items (5)
DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS ⋮ An efficient alternative to the exact evaluation of the quickest path flow network reliability problem ⋮ Algorithms for the quickest time distribution of dynamic stochastic-flow networks ⋮ Location of speed-up subnetworks ⋮ Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
This page was built for publication: Reliable and Restricted Quickest Path Problems
