This paper is concerned with the stochastic shortest path problem with recourse when
limited forms of spatial and temporal arc cost dependencies are accounted for. Recourse is …

We consider shortest path problems defined on graphs with random arc costs. We assume
that information on arc cost values is accumulated as the graph is being traversed. The …

We consider a stochastic extension of the loop-free shortest path problem with adversarial
rewards. In this episodic Markov decision problem an agent traverses through an acyclic …

Abstract The Shortest Path with Recourse Problem involves finding the shortest expected‐
length paths in a directed network, each of whose arcs have stochastic traversal lengths (or …

We study optimal routing policy problems in stochastic time-dependent networks, where link
travel times are modeled as random variables with time-dependent distributions. These are …

This paper studies an online linear optimization problem generalizing the multi-armed
bandit problem. Motivated primarily by the task of designing adaptive routing algorithms for …

We study the problem of computing minimum‐cost paths through a time‐varying network, in
which the travel time and travel cost of each arc are known functions of one's departure time …

We consider a routing policy that forms a dynamic shortest path in a network with
independent, positive and discrete random arc costs. When visiting a node in the network …

This paper considers online stochastic optimization problems where uncertainties are
characterized by a distribution that can be sampled and where time constraints severely limit …

We consider routing problems in dynamic networks where arc travel times are both random
and time dependent. The problem of finding the best route to a fixed destination is …