Finding theKth shortest path in a time-schedule network

DOI10.1002/NAV.20061zbMath1090.90074OpenAlexW2082298232MaRDI QIDQ4680459

Yen-Liang Chen, Kwei Tang

Publication date: 1 June 2005

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20061

zbMATH Keywords

time-schedule network\(K\)th shortest path

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (1)

Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs

This page was built for publication: Finding theKth shortest path in a time-schedule network