Gallo G. Reoptimization procedures in shortest path problems. Internal note IEI-B79-07, 1979. |

Abstract (English) |
In most algorithms for Transportation and Communication Models a sequence of Shortest Path Problems must be solved, where each problem is only slightly different from the preceding. Computational procedures are proposed to find the new shortest paths starting from the old shortest paths in two cases: i)the node from which the shortest paths are to be determined is changed; ii)the cost of one arc is modified ( either increased or decreased). | |

Subject | shortest path networks |

1) Download Document PDF |

Open access Restricted Private