Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille

DOI10.1051/ro/1996300403331zbMath0862.90123MaRDI QIDQ5689632

No author found.

Publication date: 26 January 1997

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105133

zbMATH Keywords

shortest paths; large sparse graphs; road-like networks

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C06: Large-scale problems in mathematical programming

Related Items

Object modeling and path computation for multimodal travel systems