Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm

DOI10.1007/s11750-007-0033-0zbMath1144.90470OpenAlexW2057524007MaRDI QIDQ926599

Maria Eugénia Captivo, Joao Carlos Namorado Climaco, Marta M. B. Pascoal

Publication date: 20 May 2008

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-007-0033-0

zbMATH Keywords

rankingnetworksgraph algorithmsquickest path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (5)

Fast and fine quickest path algorithm ⋮ A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ The energy-constrained quickest path problem ⋮ Conveyor operations in distribution centers: modeling and optimization ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem

Cites Work

• The quickest path problem
• Algorithms for the quickest path problem and the enumeration of quickest paths
• Finding the \(k\) quickest simple paths in a network
• An algorithm for the quickest path problem
• An algorithm for ranking quickest simple paths
• A comprehensive survey on the quickest path problem
• An efficient algorithm for K shortest simple paths
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm