We consider a variety of problems in geometric domains. Firstly, we begin with a delivery
problem with heterogeneous agents where the agents can collaborate to deliver a package …

In this paper we introduce and study cooperative variants of the Traveling Salesperson
Problem. In these problems a salesperson has to make deliveries to customers who are …

Abstract The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of
Euclidean TSP. We do not require that all points lie on the salesman tour. However, points …

This paper focuses on improving the efficiency of the genetic algorithm, analysis the
shortages of the algorithm at coding method and mutation operator and selected a TSP …

This thesis is devoted to geometric optimization problems of the fol¬ lowing kind: given a sot
of points Pc Md, we wish to compute a certain straight-line graph on P with minimum length …

The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of
Euclidean TSP. We do not require that all points lie on the salesman tour. However, points …

Expanders are graphs that are sparse, yet highly connected. In this thesis, we consider an
elementary algorithm for constructing expanders, how to use them for proving hardness of …