The first K minimum cost paths in a time-schedule network

DOI10.1057/palgrave.jors.2601028zbMath1131.90354OpenAlexW2024933657MaRDI QIDQ4658384

Yen-Liang Chen, Dan B. Rinks, Kwei Tang

Publication date: 16 March 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601028

zbMATH Keywords

shortest pathnetworks and graphsroad transport

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs ⋮ Finding \(K\) shortest looping paths with waiting time in a time--window network ⋮ Solving the \(k\)-shortest path problem with time windows in a time varying network ⋮ Minimization of travel time and weighted number of stops in a traffic-light network

This page was built for publication: The first K minimum cost paths in a time-schedule network