2346. Integer Programming Formulations for the Target Visitation Problem - Revisited
Invited abstract in session TA-17: Modeling and competitive analysis in routing and covering problems, stream Combinatorial Optimization.
Tuesday, 8:30-10:00Room: Esther Simpson 2.08
Authors (first author is the speaker)
| 1. | Sven Mallach
|
| University of Siegen |
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
- Mathematical Programming
- Programming, Integer
Status: accepted
Back to the list of papers