Shortest path algorithms

MaRDI QIDQ5294048zbMATH OpenFDO

Authors Paola Festa

Publication date 23 July 2007

zbMATH Keywords

combinatorial optimizationnetwork flow problemsnetwork optimizationshortest path problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Real-world applications of shortest path algorithms
• scientific article; zbMATH DE number 3952519
• The shortest-path problem. Analysis and comparison of methods
• Shortest-path algorithms and dynamic cost changes
• Shortest-path algorithms: Taxonomy and annotation

Cited in

(14)

• Implementation and analysis of alternative algorithms for generalized shortest path problems
• Computing shortest paths in networks derived from recurrence relations
• Calculating path algorithms
• On the history of the shortest path problem
• Mathematical modeling for equipment updating based on shortest path
• scientific article; zbMATH DE number 1003284 (Why is no real title available?)
• scientific article; zbMATH DE number 434492 (Why is no real title available?)
• scientific article; zbMATH DE number 6500497 (Why is no real title available?)
• Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming
• Real-world applications of shortest path algorithms
• Engineering Route Planning Algorithms
• Point-to-Point Shortest Path Algorithms with Preprocessing
• Complexity analysis and optimization of the shortest path tour problem
• An exact method for reliable shortest path problems with correlation

This page was built for publication: Shortest path algorithms

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