AN APPROACH TO TRIP- AND ROUTE-PLANNING PROBLEMS

DOI10.1080/019697202753306497MaRDI QIDQ4781411zbMATH OpenOpenAlexFDO

Authors Georgii Khachaturov

Publication date 15 March 2004

Published in Cybernetics and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/019697202753306497

zbMATH Keywords

auxiliary graphset-to-set shortest path problem

Mathematics Subject Classification ID

Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Automated systems (robots, etc.) in control theory (93C85)

Recommendations

• Solving the shortest path tour problem
• Complexity analysis and optimization of the shortest path tour problem
• An Appraisal of Some Shortest-Path Algorithms
• Shortest path calculation in large road networks
• The shortest-path problem. Analysis and comparison of methods

Cites work

• scientific article; zbMATH DE number 47903 (Why is no real title available?)
• scientific article; zbMATH DE number 1532337 (Why is no real title available?)
• A note on two problems in connexion with graphs

Cited in

(8)

• Rule based shortest path query algorithm
• scientific article; zbMATH DE number 6856239 (Why is no real title available?)
• Route generation and description using a logical and analogical framework
• scientific article; zbMATH DE number 39101 (Why is no real title available?)
• scientific article; zbMATH DE number 7455732 (Why is no real title available?)
• Computing shortest heterochromatic monotone routes
• Bundling all shortest paths
• Tourenplanung für zwei Depots bei offenen Touren

This page was built for publication: AN APPROACH TO TRIP- AND ROUTE-PLANNING PROBLEMS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4781411)