Algorithms for the quickest path problem and the enumeration of quickest paths
From MaRDI portal
Publication:1184451
DOI10.1016/0305-0548(91)90063-WzbMath0747.90104OpenAlexW1997102717MaRDI QIDQ1184451
Guoliang Xue, Shangzhi Sun, J. Ben Rosen
Publication date: 28 June 1992
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(91)90063-w
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Solving the absolute 1-center problem in the quickest path case, Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\), The all-pairs quickest path problem, Efficient contraflow algorithms for quickest evacuation planning, Probabilistic quickest path algorithm, A label-setting algorithm for finding a quickest path, An algorithm for ranking quickest simple paths, Fast and fine quickest path algorithm, On the computation of fast data transmissions in networks with capacities and delays, Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints, A comprehensive survey on the quickest path problem, Path Problems in Complex Networks, Evacuation modeling: a case study on linear and nonlinear network flow models, An efficient alternative to the exact evaluation of the quickest path flow network reliability problem, Min‐Max quickest path problems, Multiobjective routing problems, Algorithms for the quickest path problem and the reliable quickest path problem, Internet packet routing: application of a \(K\)-quickest path algorithm, Algorithms for the quickest time distribution of dynamic stochastic-flow networks, The energy-constrained quickest path problem, The quickest flow problem, On the sum-max bicriterion path problem., The quickest path problem with batch constraints., Unnamed Item, Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm, Inverse quickest center location problem on a tree, Dealing with residual energy when transmitting data in energy-constrained capacitated networks, An algorithm for finding the \(k\) quickest paths in a network, Multicriteria path and tree problems: discussion on exact algorithms and applications, The quickest path problem with interval lead times, An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method, A survey on models and algorithms for discrete evacuation planning network problems, Reliability based assignment in stochastic-flow freight network, Finding the k Shortest Paths, Fast data transmission and maximal dynamic flow., The multichannel quickest-path problem, Algorithms for the constrained quickest path problem and the enumeration of quickest paths, Finding the \(k\) quickest simple paths in a network, The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets, Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
Cites Work
