Shortest path problem with multiple shortest paths

zbMATH Open1240.90454MaRDI QIDQ3170934FDOQ3170934

Authors: Zhijian Wang, Weiyi Han, Yijun Li 

Publication date: 29 September 2011

Recommendations

• Dijkstra's shortest-path algorithm in a network with variable weight matrices
• Shortest path methods: A unifying approach
• An Appraisal of Some Shortest-Path Algorithms
• Computing the nxm shortest path efficiently
• The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm

zbMATH Keywords

shortest path problemDijkstra algorithmYen algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (6)

• Dijkstra's shortest-path algorithm in a network with variable weight matrices
• A new matrix operator-based algorithm for the shortest path problem
• Title not available (Why is that?)
• Finding the shortest paths by node combination
• The shortest path problem with two objective functions
• Finding Multi-Constrained Multiple Shortest Paths

This page was built for publication: Shortest path problem with multiple shortest paths

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