A generalized permanent label setting algorithm for the shortest path between specified nodes

DOI10.1016/0022-247X(72)90091-1zbMath0234.90063MaRDI QIDQ2551743

Nemhauser, George I.

Publication date: 1972

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (8)

Multiobjective routing problems ⋮ Optimal location of routes for vehicles transporting hazardous materials ⋮ 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 ⋮ A hybrid approach to discrete mathematical programming ⋮ Shortest paths on dynamic graphs ⋮ An improvement of Dijkstra's method for finding a shortest path in a graph ⋮ The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets

Cites Work

• A note on two problems in connexion with graphs
• On the Shortest Route Through a Network
• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: A generalized permanent label setting algorithm for the shortest path between specified nodes