This paper considers the shortest path problem with waiting costs (SPWC) as an extension to the shortest path problem with time windows. The problem consists of finding the minimum cost path in a ...

One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing network - ...

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 ...

In the teaching of computer science, metaphors and analogies are especially fitting: the essence of algorithms is abstract discrete structures, and to help learners quickly grasp the logic within, we ...

Mathematics of Operations Research, Vol. 38, No. 2 (May 2013), pp. 209-227 (19 pages) We consider a totally asynchronous stochastic approximation algorithm, Q-learning, for solving finite space ...

Here is a problem I'm working on. Say you have a weighted, directed graph with n vertices and m edges, and you want to find the shortest path from s to all other vertices, *but* you can only use some ...