Reliable and restricted quickest path problems

DOI10.1007/978-3-642-21527-8_36MaRDI QIDQ3091515zbMATH OpenOpenAlexFDO

Authors Stefan Ruzika, Markus Thiemann

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

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25) Programming involving graphs or networks (90C35)

Recommendations

• MIN-MAX quickest path problems
• Algorithms for the quickest path problem and the reliable quickest path problem
• On solving quickest time problems in time-dependent, dynamic networks
• The quickest transshipment problem
• On the quickest path problem

Cited in

(11)

• The quickest path problem with batch constraints.
• On solving quickest time problems in time-dependent, dynamic networks
• Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
• Location of speed-up subnetworks
• An efficient alternative to the exact evaluation of the quickest path flow network reliability problem
• Algorithms for the quickest path problem and the reliable quickest path problem
• Algorithms for the quickest time distribution of dynamic stochastic-flow networks
• DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS
• MIN-MAX quickest path problems
• System reliability for quickest path problems under time threshold and budget
• Optimal routing for maximizing the travel time reliability

This page was built for publication: Reliable and restricted quickest path problems

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