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.











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)