Implementation of algorithms forK shortest loopless paths

DOI10.1002/net.3230160204zbMath0642.90097OpenAlexW1931114878MaRDI QIDQ3783860

Aarni Perko

Publication date: 1986

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230160204

zbMATH Keywords

ImplementationsEfficient storage structuresloopless k shortest path algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05)

Related Items (9)

Multiobjective routing problems ⋮ Enumerating \(K\) best paths in length order in DAGs ⋮ An efficient time and space \(K\) point-to-point shortest simple paths algorithm ⋮ An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem ⋮ An Experimental Study on Approximating k Shortest Simple Paths ⋮ On the \(K\) shortest path trees problem ⋮ Finding the k Shortest Paths ⋮ A penalty function heuristic for the resource constrained shortest path problem ⋮ The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets

Cites Work

• A Method for the Solution of the N th Best Path Problem

This page was built for publication: Implementation of algorithms forK shortest loopless paths