scientific article; zbMATH DE number 938615

zbMATH Open0858.90130MaRDI QIDQ4896933FDOQ4896933

Authors: Ahmed A. A. Radwan 

Publication date: 27 October 1996

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

shortest pathssparse networksreoptimizationtransportation networkintegrated single source algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited In (4)

• Routing algorithms with range restriction in sparse supply networks
• Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics
• Shortest path reoptimization vs resolution from scratch: a computational comparison
• Title not available (Why is that?)

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)