Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · Journal of the Operational Research Society · 2001

The first <i>K</i> minimum cost paths in a time-schedule network

Y-L Chen, Dan B. Rinks, Kai Tang

Cited by 9Abstract and details only

Abstract

The time-constrained shortest path problem is an important generalisation of the classical shortest path problem and in recent years has attracted much research interest. We consider a time-schedule network, where every node in the network has a list of pre-specified departure times and departure from a node may take place only at one of these departure times. The objective of this paper is to find the first K minimum cost simple paths subject to a total time constraint. An efficient polynomial time algorithm is developed. It is also demonstrated that the algorithm can be modified for finding the first K paths for all possible values of total time.

Cite this paper

APA 7

Chen, Y.-L., Rinks, D. B., & Tang, K. (2001). The first <i>K</i> minimum cost paths in a time-schedule network. Journal of the Operational Research Society, 52(1), 102–108. https://doi.org/10.1057/palgrave.jors.2601028

MLA 9

Chen, Y-L, et al. “The first <i>K</i> minimum cost paths in a time-schedule network.” Journal of the Operational Research Society, vol. 52, no. 1, 2001, pp. 102–08, https://doi.org/10.1057/palgrave.jors.2601028.

Chicago

Chen, Y-L, Dan B. Rinks, and Kai Tang. 2001. “The first <i>K</i> minimum cost paths in a time-schedule network.” Journal of the Operational Research Society 52 (1): 102–08. https://doi.org/10.1057/palgrave.jors.2601028.

Harvard

Chen, Y.-L., Rinks, D.B. and Tang, K. (2001) ‘The first <i>K</i> minimum cost paths in a time-schedule network’, Journal of the Operational Research Society, 52(1), pp. 102–108. Available at: https://doi.org/10.1057/palgrave.jors.2601028.

BibTeX
@article{chen2001first,
  title = {{The first <i>K</i> minimum cost paths in a time-schedule network}},
  author = {Chen, Y-L and Rinks, Dan B. and Tang, Kai},
  journal = {Journal of the Operational Research Society},
  volume = {52},
  number = {1},
  pages = {102--108},
  year = {2001},
  doi = {10.1057/palgrave.jors.2601028}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers