activity
20232026
most citedRealistic Runtime Analysis for Quantum Simplex Computation

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 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…