The computation of point-to-point shortest paths on time-dependent transportation networks has many practical applications. Finding the shortest path on transportation networks, taking into account ...

In this paper the authors introduce the median shortest path problem (MSPP). The MSPP is a bicriterion path problem with the objectives being the minimization of the total path length and the ...

Recently, a research team from Hokkaido University made significant progress in the complexity study of the Hitting Geodesic Intervals (HGI) problem. The HGI problem aims to find a small set of ...

Whole pineapples are served in a restaurant in London. To ensure freshness, the pineapples are purchased in Hawaii and air freighted from Honolulu to Heathrow in London. The following network diagram ...

CATALOG DESCRIPTION: Design and analysis of advanced algorithms: graph algorithms; maximal network flows; min-cost flow algorithms; convex cost flows. REQUIRED TEXT ...