In the Dial-a-Ride Problem (DARP) the aim is to design vehicle routes for a set of users who must be transported between given origin and destination pairs, subject to a variety of side constraints. The standard DARP objective is cost minimization. In addition to cost, the objectives considered...

This paper, proposes an exact algorithm for the problem of locating a pipeline between two points of a network, as well as a set of safety valves which help control the damage caused by possible spills along the pipeline. A labelling approach is developed to determine simultaneously the optimal...

We address the problem of finding the K best paths connecting a given pair of nodes in a directed acyclic graph (DAG) with arbitrary lengths. One of the main results in this paper is the proof that a tree representing the kth shortest path is obtained by an arc exchange in one of the previous...