Reoptimization procedures in shortest path problem

DOI10.1007/BF02092136zbMath0512.90094OpenAlexW1990043277MaRDI QIDQ3657801

No author found.

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

algorithmtransportation networkscomputational comparisonsre-optimizationnumerical efficiencyshortest-path problemDial's label-setting algorithm

Mathematics Subject Classification ID

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

Related Items (11)

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

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