Ranking One Million Simple Paths in Road Networks

DOI10.1142/S0217595916500421zbMath1354.90027OpenAlexW2522844978MaRDI QIDQ5506763

Antonio Sedeño-Noda

Publication date: 16 December 2016

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595916500421

zbMATH Keywords

combinatorial optimizationshortest path algorithmsbest solutions

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Distance in graphs (05C12)

Related Items (1)

Solving a constrained economic lot size problem by ranking efficient production policies

Uses Software

• DIMACS

Cites Work

• A note on two problems in connexion with graphs
• An efficient time and space \(K\) point-to-point shortest simple paths algorithm
• Solving k-shortest and constrained shortest path problems efficiently
• Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
• On the \(K\) shortest path trees problem
• A new implementation of Yen's ranking loopless paths algorithm
• Enumerating \(K\) best paths in length order in DAGs
• A Method for the Solution of the N th Best Path Problem
• An efficient algorithm for K shortest simple paths
• Finding the k shortest simple paths
• Near-shortest and K-shortest simple paths
• Finding the K Shortest Loopless Paths in a Network
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Automata, Languages and Programming

This page was built for publication: Ranking One Million Simple Paths in Road Networks