AN APPROACH TO TRIP- AND ROUTE-PLANNING PROBLEMS
From MaRDI portal
The problem is to solve the set-to-set shortest path problem, i.e., to find a shortest path between two sets \(A\), \(B\) of nodes of a given graph \(G\). The problem is reduced to a point-to-point problem in the special case that the sets \(A\), \(B\) can be represented as nodes of an auxiliary graph on \(G\). Some practical applications are discussed.
Recommendations
Cites work
Cited in
(9)- Route generation and description using a logical and analogical framework
- Bundling all shortest paths
- Computing shortest heterochromatic monotone routes
- scientific article; zbMATH DE number 39101 (Why is no real title available?)
- scientific article; zbMATH DE number 1156686 (Why is no real title available?)
- scientific article; zbMATH DE number 6856239 (Why is no real title available?)
- scientific article; zbMATH DE number 7455732 (Why is no real title available?)
- Rule based shortest path query algorithm
- 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)