Algorithms for Obtaining Shortest Paths Visiting Specified Nodes
From MaRDI portal
Publication:5667963
DOI10.1137/1015031zbMath0254.65048MaRDI QIDQ5667963
Publication date: 1973
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1015031
Related Items
New formulations for the elementary shortest-path problem visiting a given set of nodes, Multicriteria movement synchronization scheduling problems and algorithms, Some optimal path problems subject to improvements