Algorithms for Obtaining Shortest Paths Visiting Specified Nodes

DOI10.1137/1015031zbMath0254.65048OpenAlexW1965039153MaRDI QIDQ5667963

Toshihide Ibaraki

Publication date: 1973

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1015031

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Algorithms in computer science (68W99)

Related Items (3)

Multicriteria movement synchronization scheduling problems and algorithms ⋮ New formulations for the elementary shortest-path problem visiting a given set of nodes ⋮ Some optimal path problems subject to improvements

This page was built for publication: Algorithms for Obtaining Shortest Paths Visiting Specified Nodes