Let P be a set of n points in the Euclidean plane and let O be the origin point in the plane. In the k-tour cover problem (called frequently the capacitated vehicle routing problem), the goal is to minimize the total length of tours that cover all points in P, such that each tour starts and ends in O and covers at most k points from P. The k-tour cover problem is known to be NP-hard. It is also known to admit constant factor approximation algorithms for all values of k and even a polynomial-time approximation scheme (PTAS) for small values of k, k = O(log n/ log log n). In this paper, we significantly enlarge the set of values of k for which a PTAS is provable. We present a new PTAS for all values of k <= 2(log delta n), where delta...
AbstractThe (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean T...
International audienceThe multi-vehicle covering tour (m-CTP) involves finding a minimum-length set ...
This paper discusses the κ-BENDS TRAVELING SALESMAN PROBLEM. In this NP-complete problem, the inputs...
Let P be a set of n points in the Euclidean plane and let O be the origin point in the plane. In the...
Let P be a set of n points in the Euclidean plane and let O be the origin point in the plane. In the...
In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given a collection of geometr...
This paper gives a partitioning scheme for the geometric, planar traveling salesman problem, under t...
Abstract. The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean...
In the Euclidean traveling salesman problem with discrete neighborhoods, we are given a set of point...
We study the Min-k-SCCP on the partition of a complete weighted digraph by k vertex-disjoint cycles ...
We give a polynomial time approximation scheme (PTAS) for the unit demand capacitated vehicle routin...
AbstractWe introduce a geometric version of the Covering Salesman Problem: Each of the n salesman's ...
In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given a collection of geometr...
In the TSP with neighborhoods problem we are given a set of $n$ regions (neighborhoods) in the plane...
The Euclidean TSP with neighborhoods (TSPN) problem seeks a shortest tour that visits a given collec...
AbstractThe (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean T...
International audienceThe multi-vehicle covering tour (m-CTP) involves finding a minimum-length set ...
This paper discusses the κ-BENDS TRAVELING SALESMAN PROBLEM. In this NP-complete problem, the inputs...
Let P be a set of n points in the Euclidean plane and let O be the origin point in the plane. In the...
Let P be a set of n points in the Euclidean plane and let O be the origin point in the plane. In the...
In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given a collection of geometr...
This paper gives a partitioning scheme for the geometric, planar traveling salesman problem, under t...
Abstract. The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean...
In the Euclidean traveling salesman problem with discrete neighborhoods, we are given a set of point...
We study the Min-k-SCCP on the partition of a complete weighted digraph by k vertex-disjoint cycles ...
We give a polynomial time approximation scheme (PTAS) for the unit demand capacitated vehicle routin...
AbstractWe introduce a geometric version of the Covering Salesman Problem: Each of the n salesman's ...
In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given a collection of geometr...
In the TSP with neighborhoods problem we are given a set of $n$ regions (neighborhoods) in the plane...
The Euclidean TSP with neighborhoods (TSPN) problem seeks a shortest tour that visits a given collec...
AbstractThe (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean T...
International audienceThe multi-vehicle covering tour (m-CTP) involves finding a minimum-length set ...
This paper discusses the κ-BENDS TRAVELING SALESMAN PROBLEM. In this NP-complete problem, the inputs...