1 citations · 1 across the 2 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2024
A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
Sabrina C. L. Ammann, Birte Ostermann, Sebastian Stiller +1
The Traveling Salesman Problem (TSP) is one of the most extensively researched and widely applied combinatorial optimization problems. It is NP-hard even in the symmetric and metri…
math.OC2018
Cuts, Primal Heuristics, and Learning to Branch for the Time-Dependent Traveling Salesman Problem
Christoph Hansknecht, Imke Joormann, Sebastian Stiller
We consider the time-dependent traveling salesman problem (TDTSP), a generalization of the asymmetric traveling salesman problem (ATSP) to incorporate time-dependent cost functions…