## Abstract

A new shortest chain algorithm is developed for finding shortest or longest chains from one node to all other nodes in a connected network. The network is first transformed into a directed network. The algorithm constructs an acyclic auxiliary shortest (longest) chain network from the directed network, using the concepts of minimum cost and remaining degree of nodes in an attempt to make several "parallel" decisions at each step. The twofold decision process causes faster convergence to the optimum solution than with a version of the algorithm using only the minimum cumulative cost criteria, or with node labeling techniques. The algorithm works on networks with all cost coefficients either nonnegative or nonpositive, i.e., mixed costs are not allowed.

Original language | English (US) |
---|---|

Pages (from-to) | 111-120 |

Number of pages | 10 |

Journal | Applied Mathematics and Computation |

Volume | 37 |

Issue number | 2 |

DOIs | |

State | Published - May 1990 |

Externally published | Yes |

## ASJC Scopus subject areas

- Computational Mathematics
- Applied Mathematics

## Fingerprint

Dive into the research topics of 'A new O(n^{2}) shortest chain algorithm'. Together they form a unique fingerprint.