2230. Integer Programming Formulations for the Target Visitation Problem - Revisited
Invited abstract in session TD-2: Integer Programming II, stream Discrete and Combinatorial Optimization.
Thursday, 14:30-16:00Room: H4
Authors (first author is the speaker)
| 1. | Sven Mallach
|
| University of Siegen & University of Bonn |
Abstract
The target visitation problem asks for a permutation (or tour) of target locations such that the difference between a reward expressing pairwise relative ordering preferences and the traveling distance is maximum. It can thus be seen as a combination of the traveling salesman problem and the linear ordering problem, or likewise as a generalization of the traveling salesman problem with precedences. In 2015, Hildenbrandt proposed according integer programming formulations along with polyhedral investigations. In this work, we extend and slightly revise some of these results, we highlight relations to betweenness and quadratic linear ordering problems, and we give some impressions about the computational performance obtained with the most promising integer programming models.
Keywords
- Combinatorial Optimization
- Integer Programming
- Routing
Status: accepted
Back to the list of papers