We present a fast algorithm for computing all shortest paths between source nodes s ∈ S and target nodes t ∈ T . This problem is important as an initial step for many operations research problems (e.g., the vehicle routing problem), which require the distances between S and T as input. Our approach is based on highway hierarchies, which are also used for the currently fastest speedup techniques...

* Correspondence: [email protected] Department of Mathematics, Faculty of Science, Imam Khomeini International University, P.O. Box 34149-16818, Qazvin, Iran Full list of author information is available at the end of the article Abstract In this paper, an iterative sequence for relatively nonexpansive multi-valued mappings by using the notion of generalized projection is introduced, and th...

Systematic, well-designed research provides the most effective approach to the solution of many problems facing highway administrators and engineers. Often, highway problems are of local interest and can best be studied by highway departments individually or in cooperation with their state universities and others. However, the accelerating growth of highway transportation develops increasingly ...

Systematic, well-designed research provides the most effective approach to the solution of many problems facing highway administrators and engineers. Often, highway problems are of local interest and can best be studied by highway departments individually or in cooperation with their state universities and others. However, the accelerating growth of highway transportation develops increasingly ...

Systematic, well-designed research provides the most effective approach to the solution of many problems facing highway administrators and engineers. Often, highway problems are of local interest and can best be studied by highway departments individually or in cooperation with their state universities and others. However, the accelerating growth of highway transportation develops increasingly ...