The first K minimum cost paths in a time-schedule network - Chen, Y-L; Rinks, D; Tang, K (The Journal of the Operational Research Society, 2001)
Keywords: Algorithms; Applied sciences; Business and Management; Departure time; Exact sciences and technology; Flows in networks. Combinatorial problems; Management; Mathematical procedures; Minimization of cost; Network topologies; networks and graphs; Operational research and scientific management; Operational research. Management science; Operations research; Operations Research/Decision Theory; road transport; Scheduling; shortest path; Studies; Technical Note; Technical Notes; Time windows; Total costs; Travel expenses; Travel time; Unit costs; networks and graphs; road transport; shortest path; Graph; Network; Task scheduling; Shortest path; Decision criterion; Time complexity; Polynomial time