A computational improvement for a shortest paths ranking algorithm
From MaRDI portal
Publication:1328620
DOI10.1016/0377-2217(94)90162-7zbMath0806.90120OpenAlexW2005309726MaRDI QIDQ1328620
Filipe Manuel A. Pires, Ernesto Q. Vieira Martins, Joaquim João E. R. Silvestre Madeira, José Augusto de Azevedo
Publication date: 20 February 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90162-7
Related Items (6)
Branch-and-price approaches for the network design problem with relays ⋮ Multiobjective routing problems ⋮ Regenerator Location Problem in Flexible Optical Networks ⋮ Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa ⋮ A bicriterion approach for routing problems in multimedia networks ⋮ DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
Cites Work
This page was built for publication: A computational improvement for a shortest paths ranking algorithm
