Reoptimization procedures in shortest path problem

DOI10.1007/BF02092136MaRDI QIDQ3657801zbMATH OpenOpenAlexFDO

Authors

Publication date 1980

Published in Rivista di Matematica per le Scienze Economiche e Sociali (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02092136

zbMATH Keywords

algorithmcomputational comparisonsDial's label-setting algorithmnumerical efficiencyre-optimizationshortest-path problemtransportation networks

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10) Programming involving graphs or networks (90C35)

Cited in

(11)

• A reoptimization algorithm for the shortest path problem with time windows
• A new algorithm to find the shortest paths between all pairs of nodes
• A new algorithm for reoptimizing shortest paths when the arc costs change
• An auction-based approach for the re-optimization shortest path tree problem
• A GRASP and path relinking heuristic for rural road network development
• Incremental network design with shortest paths
• Solving the nearly symmetric all-pairs shortest-path problem
• Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
• Shortest paths on dynamic graphs
• Shortest path reoptimization vs resolution from scratch: a computational comparison
• Shortest-path queries in static networks

This page was built for publication: Reoptimization procedures in shortest path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3657801)