Friday, 11:00 - 11:25 h, Room: H 3013


Achim Hildenbrandt
An extended formulation for the target visitation problem

Coauthors: Olga Heismann, Gerhard Reinelt


The target visitation problem (TVP) is concerned with finding a route to visit a set of targets starting from and returning to some base. In addition to the distance traveled, a tour is evaluated also by taking preferences into account addressing the sequence in which the targets are visited. The problem thus is a combination of two well-known combinatorial optimization problems: the traveling salesman and the linear ordering problem. The TVP was introduced to serve the planning of routes for unmanned aerial vehicles (UAVs) and it can be employed to model several kinds of routing problems with additional restrictions. In this talk we want to point out some properties of the polyhedral structure of an associated polytope and also present an extended formulation. We will use this formulation to develop a branch-and-price algorithm. Computational results will be discussed.


Talk 2 of the contributed session Fri.1.H 3013
"Extended formulations" [...]
Cluster 2
"Combinatorial optimization" [...]


  installment loans . The main advantage of Viagra Soft Tablets comparing with other products of this type is its faster on-set effect.