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

The Minimum Latency Problem (MLP) is a variant of the Traveling Salesman Problem which
aims to minimize the sum of arrival times at vertices. The problem arises in a number of …

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 …

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 the capacitated vehicle routing problem we are given the locations of customers and
depots, along with a vehicle of capacity k k. The objective is to find a minimum length …

We present a unified framework for minimizing average completion time for many seemingly
disparate online scheduling problems, such as the traveling repairperson problems (TRP) …

Let G=(V, E, w) be an undirected graph with positive weight w (e) on each edge e∈ E. Given
a starting vertex s∈ V and a subset U⊂ V as the demand vertex set, the minimum latency …

An ambulance dispatching policy, Centrality policy, is proposed in an effort to reduce the
response time in demanding emergency situations such as in natural disasters, based on …

Optimization tasks are often complex, CPU-time consuming and usually deal with finding the
best (or good enough) solution among alternatives for a given problem. Parallel …

We give a 7.18-approximation algorithm for the minimum latency problem that uses only
O(n\logn) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and …