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

DOI10.1051/ro/1996300403331zbMath0862.90123OpenAlexW2462628777MaRDI 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 pathslarge sparse graphsroad-like networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06)

Related Items (1)

Object modeling and path computation for multimodal travel systems

This page was built for publication: Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille