Near-shortest and K-shortest simple paths
From MaRDI portal
Publication:5318272
DOI10.1002/net.20077zbMath1102.68090OpenAlexW4231238697MaRDI QIDQ5318272
R. Kevin Wood, W. Matthew Carlyle
Publication date: 22 September 2005
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20077
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (20)
Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network ⋮ An exact method for the biobjective shortest path problem for large-scale road networks ⋮ A branch and price approach for routing and refueling station location model ⋮ A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem ⋮ A simulated annealing for multi-criteria network path problems ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Approximating the Canadian traveller problem with online randomization ⋮ An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks ⋮ Optimization problems with evidential linear objective ⋮ An efficient time and space \(K\) point-to-point shortest simple paths algorithm ⋮ Exact Solution of the Evasive Flow Capturing Problem ⋮ Lagrangian relaxation and enumeration for solving constrained shortest-path problems ⋮ The global optimal algorithm of reliable path finding problem based on backtracking method ⋮ Evasive flow capture: a multi-period stochastic facility location problem with independent demand ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Robust scheduling on a single machine to minimize total flow time ⋮ Path optimization for the resource-constrained searcher ⋮ Extensions of labeling algorithms for multi‐objective uncertain shortest path problems ⋮ Ranking One Million Simple Paths in Road Networks
This page was built for publication: Near-shortest and K-shortest simple paths
