Solving k-shortest and constrained shortest path problems efficiently

DOI10.1007/BF02216932zbMath0705.90088OpenAlexW2069295656MaRDI QIDQ918435

Christopher C. Skiscim, Bruce L. Golden

Publication date: 1989

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02216932

zbMATH Keywords

adaptive versionk-shortest paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (11)

Path Problems in Complex Networks ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ Intelligent transportation systems -- Enabling technologies ⋮ Multiobjective routing problems ⋮ An exact bidirectional pulse algorithm for the constrained shortest path ⋮ A computational study of solution approaches for the resource constrained elementary shortest path problem ⋮ An efficient time and space \(K\) point-to-point shortest simple paths algorithm ⋮ Golden ratio versus pi as random sequence sources for Monte Carlo integration ⋮ Network reduction for the acyclic constrained shortest path problem ⋮ An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem ⋮ Ranking One Million Simple Paths in Road Networks

Cites Work

• Unnamed Item
• Unnamed Item
• An improvement of Dijkstra's method for finding a shortest path in a graph
• Shortest paths in Euclidean graphs
• On algorithms for finding the k shortest paths in a network
• Computingk-shortest path lengths in euclidean networks
• A dual algorithm for the constrained shortest path problem
• Shortest paths with euclidean distances: An explanatory model

This page was built for publication: Solving k-shortest and constrained shortest path problems efficiently