scientific article; zbMATH DE number 938615

MaRDI QIDQ4896933zbMATH OpenFDO

Authors Ahmed A. A. Radwan

Publication date 27 October 1996

zbMATH Keywords

shortest pathssparse networksreoptimizationtransportation networkintegrated single source algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 2096648
• Shortest path methods: A unifying approach
• Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille
• scientific article; zbMATH DE number 1488066

Cited in

(4)

• Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics
• Routing algorithms with range restriction in sparse supply networks
• Shortest path reoptimization vs resolution from scratch: a computational comparison
• scientific article; zbMATH DE number 2096648 (Why is no real title available?)

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 Q4896933)