A new algorithm for reoptimizing shortest paths when the arc costs change
type: Item
instance of: scholarly article
title: A new algorithm for reoptimizing shortest paths when the arc costs change
zbMATH Open document ID: 1041.90062
DOI: 10.1016/S0167-6377(02)00192-X
author: Stefano Pallottino
author: Maria Grazia Scutellà
published in: Operations Research Letters
publication date: 2003-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 2005442
zbMATH Keywords: Shortest paths
zbMATH Keywords: Reoptimization
zbMATH Keywords: Flow algorithms
MaRDI profile type: Publication
cites work: Q3056948
cites work: Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
cites work: A note on two problems in connexion with graphs
cites work: Etude Et Extension D’Un Algorithme De Murghland
cites work: A dual simplex algorithm for finding all shortest paths
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: A note on the problem of updating shortest paths
cites work: Reoptimization procedures in shortest path problem
cites work: A new algorithm to find the shortest paths between all pairs of nodes
cites work: Q4363173
cites work: A new shortest path updating algorithm
cites work: Q4130999
cites work: A generalized permanent label setting algorithm for the shortest path between specified nodes
cites work: Q4811408
cites work: Dual algorithms for the shortest path tree problem
full work available at URL: s0167-6377(02)00192-x
OpenAlex ID: W2048815087
Recommended article: Q4811408
Recommended article: Shortest-Path Algorithms and Dynamic Cost Changes
Recommended article: Q4896279
Recommended article: Shortest path reoptimization vs resolution from scratch: a computational comparison
Recommended article: A reoptimization algorithm for the shortest path problem with time windows
Recommended article: On finding shortest paths in arc-dependent networks
Recommended article: Q3758579
Recommended article: An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
Recommended article: A new algorithm for the shortest‐path problem
Recommended article: An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
description: scientific article; zbMATH DE number 2005442