Anja Fischer

Anja Fischer

Auto-generated profile, based on publicly available information

Anja Fischer

TU Dortmund University

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 May 2019 in Mathematical Programming Computation
Verified
Journal Article
Closed access
PDF file
AFAnja Fischer
Anja Fischer
FFFrank Fischer
Frank Fischer
PHPhilipp Hungerländer
Philipp Hungerländer

22 January 2017 in Optimization
Verified
Journal Article
Closed access
AOAichholzer Oswin
Aichholzer Oswin
AFAnja Fischer
Anja Fischer
FFFrank Fischer
Frank Fischer
JMJ. Fabian Meier
J. Fabian Meier
UPUlrich Pferschy
Ulrich Pferschy
RSRostislav Staněk
Rostislav Staněk
The travelling salesman problem (TSP) asks for a shortest tour through all vertices of a graph with respect to the weights of the edges. The symmetric quadratic travelling salesman problem (SQTSP) associates a weight with every three vertices traversed in succession. If these weights correspond to the turning angles of the tour, we speak of the angular-metric travelling salesman problem (Angle TSP). In this paper, we first consider the SQTSP from a computational point of view. In particular, we apply a rather basic algorithmic idea and perform the separation of the classical subtour elimination constraints on integral solutions only. Surprisingly, it turns out that this approach is faster than the standard fractional separation procedure known from the literature. We also test the combination with strengthened subtour elimination constraints for both variants, but these turn out to slow down the computation. Secondly, we provide a completely different, mathematically interesting MILP linearization for the Angle TSP that needs only a linear number of additional variables while the standard linearization requires a cubic one. For medium-sized instances of a variant of the Angle TSP, this formulation yields reduced running times. However, for larger instances or pure Angle TSP instances, the new formulation takes more time to solve than the known standard model. Finally, we introduce MaxSQTSP, the maximization version of the quadratic travelling salesman problem. Here, it turns out that using some of the stronger subtour elimination constraints helps. For the special case of the MaxAngle TSP, we can observe an interesting geometric property if the number of vertices is odd. We show that the sum of inner turning angles in an optimal solution always equals . This implies that the problem can be solved by the standard ILP model without producing any integral subtours. Moreover, we give a simple constructive polynomial time algorithm to find such an optimal solution. If the number of vertices is even, the optimal value lies between 0 and and these two bounds are tight, which can be shown by an analytic solution for a regular n-gon.

7 April 2017 in Mathematical Programming
Verified
Journal Article
Closed access
PDF file
AFAnja Fischer
Anja Fischer
FFFrank Fischer
Frank Fischer
SMS. Thomas McCormick
S. Thomas McCormick

1 November 2020 in European Journal of Operational Research
Verified
Journal Article
Closed access
MDMirko Dahlbeck
Mirko Dahlbeck
AFAnja Fischer
Anja Fischer
FFFrank Fischer
Frank Fischer

29 April 2022 in European Journal of Operational Research
Verified
Journal Article
Closed access
MDMirko Dahlbeck
Mirko Dahlbeck
AFAnja Fischer
Anja Fischer
FFFrank Fischer
Frank Fischer
PHPhilipp Hungerländer
Philipp Hungerländer
KMKerstin Maier
Kerstin Maier

24 February 2017 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
PDF file
AFAnja Fischer
Anja Fischer
PHPhilipp Hungerländer
Philipp Hungerländer