Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

The cumulative capacitated vehicle routing problem (CCVRP) is a transportation problem
which occurs when the objective is to minimize the sum of arrival times at customers, instead …

In this paper, we focus on the assessment routing problem which routes teams to different
communities to assess damage and relief needs following a disaster. To address time …

We study the prize-collecting Steiner tree (PCST), prize-collecting traveling salesman
(PCTSP), and prize-collecting path (PC-Path) problems. Given a graph (V,E) with a cost on …

This paper introduces a special vehicle routing problem, ie the cumulative capacitated
vehicle routing problem with time-window constraints (Cum-CVRPTW). The problem can be …

We consider the k-traveling repairmen problem, also known as the minimum latency
problem, to multiple repairmen. We give a polynomial-time 8.497 α-approximation algorithm …

In this paper, we extend the multiple traveling repairman problem by considering a limitation
on the total distance that a vehicle can travel; the resulting problem is called the multiple …

In geographically distributed infrastructures, Preventive Maintenance (PM) plays an
important role since it improves the serviceability of components. The purpose of this paper …

We present a general framework and algorithmic approach for incremental approximation
algorithms. The framework handles cardinality constrained minimization problems, such as …

In network problems, latency is associated with the metric used to evaluate the length of the
path from a root vertex to each vertex in the network. In this work we are dealing with two …