Showing math.OCShow all
2 papers · 1 filter
math.OC2025
Benchmarking of quantum and classical SDP relaxations for QUBO formulations of real-world logistics problems
Birte Ostermann, Taylor Garnowski, Fabian Henze +7
Quadratic unconstrained binary optimization problems (QUBOs) are intensively discussed in the realm of quantum computing and polynomial optimization. We provide a vast experimental…
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…