A comprehensive survey on the quickest path problem
DOI10.1007/S10479-006-0068-XzbMATH Open1187.90076OpenAlexW1974197409MaRDI QIDQ2379862FDOQ2379862
Authors: Marta M. B. Pascoal, Maria Eugénia Captivo, Joao Carlos Namorado Climaco 
Publication date: 23 March 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10316/7731
Recommendations
- An algorithm for the quickest path problem
- Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm
- Algorithms for the quickest path problem and the enumeration of quickest paths
- Finding the \(k\) quickest simple paths in a network
- An algorithm for ranking quickest simple paths
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cites Work
- A note on two problems in connexion with graphs
- A bicriterion shortest path algorithm
- DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
- Finding the K Shortest Loopless Paths in a Network
- Algorithms for the quickest path problem and the enumeration of quickest paths
- An algorithm for finding the \(k\) quickest paths in a network
- On the quickest path problem
- Finding the \(k\) quickest simple paths in a network
- An algorithm for the quickest path problem
- The quickest path problem with interval lead times
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- Probabilistic quickest path algorithm
- An algorithm for ranking quickest simple paths
- The all-pairs quickest path problem
- Title not available (Why is that?)
- The quickest path problem
- An efficient algorithm for K shortest simple paths
- Internet packet routing: application of a \(K\)-quickest path algorithm
- On a special class of bicriterion path problems
- The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
- Multiobjective routing problems
- Transmissions in a network with capacities and delays
Cited In (22)
- Title not available (Why is that?)
- Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems
- The energy-constrained quickest path problem
- Dealing with residual energy when transmitting data in energy-constrained capacitated networks
- Fast and fine quickest path algorithm
- Algorithms for the quickest path problem and the reliable quickest path problem
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows
- An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method
- Continuous dynamic contraflow approach for evacuation planning
- A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
- Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Shortest paths with a cost constraint: a probabilistic analysis
- Algorithms for the constrained quickest path problem and the enumeration of quickest paths
- Title not available (Why is that?)
- A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
- MIN-MAX quickest path problems
- An efficient alternative to the exact evaluation of the quickest path flow network reliability problem
- Efficient continuous contraflow algorithms for evacuation planning problems
- Abstract network flow with intermediate storage for evacuation planning
- Partial contraflow with path reversals for evacuation planning
- Internet packet routing: application of a \(K\)-quickest path algorithm
This page was built for publication: A comprehensive survey on the quickest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379862)
