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

article · Networks · 1995

The shortest path with at most / nodes in each of the series/parallel clusters

Wen‐Jui Li, Hung-ping Tsao, Osman Ulular

Cited by 6Abstract and details only

Abstract

Abstract We study two related constrained shortest path problems in which the nodes are partitioned into series/parallel clusters. These and many other constrained shortest path problems occur in optimizing the layout of private networks embedded in a larger telecommunications network. The first problem deals with a situation in which, in addition to each edge being assigned a nonnegative integer weight, each node is also assigned a nonnegative integer weight, and the constraint on the path is that the total node weight incurred within each cluster should not exceed a given nonnegative integer /. The second problem considers two constraints: (i) a path cannot contain more than / nodes in one cluster and (ii) a path must traverse through at least one of a given set of special nodes in each of the traversed clusters. We propose efficient exact algorithms for solving both problems. Numerical examples are also provided.

Cite this paper

APA 7

Li, W., Tsao, H.-P., & Ulular, O. (1995). The shortest path with at most / nodes in each of the series/parallel clusters. Networks, 26(4), 263–271. https://doi.org/10.1002/net.3230260410

MLA 9

Li, Wen‐Jui, et al. “The shortest path with at most / nodes in each of the series/parallel clusters.” Networks, vol. 26, no. 4, 1995, pp. 263–71, https://doi.org/10.1002/net.3230260410.

Chicago

Li, Wen‐Jui, Hung-ping Tsao, and Osman Ulular. 1995. “The shortest path with at most / nodes in each of the series/parallel clusters.” Networks 26 (4): 263–71. https://doi.org/10.1002/net.3230260410.

Harvard

Li, W., Tsao, H.-P. and Ulular, O. (1995) ‘The shortest path with at most / nodes in each of the series/parallel clusters’, Networks, 26(4), pp. 263–271. Available at: https://doi.org/10.1002/net.3230260410.

BibTeX
@article{li1995shortest,
  title = {{The shortest path with at most / nodes in each of the series/parallel clusters}},
  author = {Li, Wen‐Jui and Tsao, Hung-ping and Ulular, Osman},
  journal = {Networks},
  volume = {26},
  number = {4},
  pages = {263--271},
  year = {1995},
  doi = {10.1002/net.3230260410}
}

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