1 citations · 1 across the 2 of their papers we have counts for
2 papers
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…
quant-ph2023★ 1 cited
Realistic Runtime Analysis for Quantum Simplex Computation
Sabrina Ammann, Maximilian Hess, Debora Ramacciotti +10
In recent years, strong expectations have been raised for the possible power of quantum computing for solving difficult optimization problems, based on theoretical, asymptotic wors…