scientific article; zbMATH DE number 1054931

MaRDI QIDQ4350042zbMATH OpenFDO

Authors Y. M. Sharaiha, Richard Thaiss

Publication date 28 August 1997

zbMATH Keywords

shortest pathtransportation networksEuclidean arc costs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Recommendations

• A Shortest Path Algorithm Based on Limited Search Heuristics
• The shortest-path problem. Analysis and comparison of methods
• Heuristic shortest path algorithms for transportation applications: state of the art
• scientific article; zbMATH DE number 3952519
• A two-phase shortest path algorithm for networks with node coordinates

Cited in

(6)

• Solving the constrained shortest path problem using random search strategy
• The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
• Unified framework for optimal routing choice under guidance information
• scientific article; zbMATH DE number 1070409 (Why is no real title available?)
• A Shortest Path Algorithm Based on Limited Search Heuristics
• Shortest-Paths Preserving Metro Maps

This page was built for publication:

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