The quickest path problem
From MaRDI portal
Publication:912765
DOI10.1016/0305-0548(90)90039-AzbMath0698.90083OpenAlexW1994909604MaRDI QIDQ912765
Publication date: 1990
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(90)90039-a
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)
Related Items (74)
Solving the absolute 1-center problem in the quickest path case ⋮ 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 ⋮ Finding \(K\) shortest looping paths in a traffic-light network ⋮ Fast and fine quickest path algorithm ⋮ Finding the k shortest paths in parallel ⋮ DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS ⋮ 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 ⋮ ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET ⋮ Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation ⋮ Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate ⋮ A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ An algorithm for the quickest path problem ⋮ An efficient alternative to the exact evaluation of the quickest path flow network reliability problem ⋮ Min‐Max quickest path problems ⋮ Multiobjective routing problems ⋮ Routing scheme of a multi-state computer network employing a retransmission mechanism within a time threshold ⋮ 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 ⋮ Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints ⋮ The energy-constrained quickest path problem ⋮ The inverse-parametric knapsack problem ⋮ Conveyor operations in distribution centers: modeling and optimization ⋮ The quickest flow problem ⋮ A method to evaluate routing policy through \(p\) minimal paths for stochastic case ⋮ System reliability for quickest path problems under time threshold and budget ⋮ Unnamed Item ⋮ Generalized nash fairness solutions for bi‐objective minimization problems ⋮ On the sum-max bicriterion path problem. ⋮ Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm ⋮ The quickest path problem with batch constraints. ⋮ Unnamed Item ⋮ Finding the first \(K\) shortest paths in a time-window network. ⋮ Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm ⋮ Stochastic flow networks via multiple paths under time threshold and budget constraint ⋮ Algorithms for the quickest path problem and the enumeration of quickest paths ⋮ Inverse quickest center location problem on a tree ⋮ Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network ⋮ Dealing with residual energy when transmitting data in energy-constrained capacitated networks ⋮ Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks ⋮ An algorithm for finding the \(k\) quickest paths in a network ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks ⋮ Finding the \(K\) shortest paths in a schedule-based transit network ⋮ On transmission time through \(k\) minimal paths of a capacitated-flow network ⋮ The first \(K\) shortest unique-arc walks in a traffic-light network ⋮ 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 branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ Network reliability for multipath TCP networks with a retransmission mechanism under the time constraint ⋮ On the quickest path problem ⋮ System Reliability Assessment throughpMinimal Paths in Stochastic Case with Backup-routing ⋮ Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks ⋮ Time version of the shortest path problem in a stochastic-flow network ⋮ Reliability based assignment in stochastic-flow freight network ⋮ Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints ⋮ Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability ⋮ Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget ⋮ Fast data transmission and maximal dynamic flow. ⋮ The multichannel quickest-path problem ⋮ The single most vital arc in the most economical path problem -- a parametric analysis ⋮ Reliability evaluation of a multistate network subject to time constraint under routing policy ⋮ Algorithms for the constrained quickest path problem and the enumeration of quickest paths ⋮ Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations ⋮ 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
- Minimum cost-reliability ratio path problem
- Shortest-path algorithms: Taxonomy and annotation
- Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956–1974)
- Deterministic network optimization: A bibliography
- Fibonacci heaps and their uses in improved network optimization algorithms
- Unnamed Item
This page was built for publication: The quickest path problem
