OPTIMAL ROUTING BY LANDMARKS IN THE TIME-DEPENDENT NETWORKS

DOI10.17223/20710410/37/10OpenAlexW2766281158MaRDI QIDQ5151077

Valentina Vladimirovna Bykova, Aleksandr A. Soldatenko

Publication date: 16 February 2021

Published in: Prikladnaya diskretnaya matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm589

zbMATH Keywords

optimal routingtime-dependent networkcorrectness of ALT algorithm

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Uses Software

• DIMACS

Cites Work

• Time-dependent SHARC-routing
• Speed-Up Techniques for Shortest-Path Computations
• The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
• Unnamed Item

This page was built for publication: OPTIMAL ROUTING BY LANDMARKS IN THE TIME-DEPENDENT NETWORKS