1 citations · 1 across the 4 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.OC2023
Initial Application of SONC to Lyapunov Stability of Dynamical Systems
Janin Heuer, Timo de Wolff
Certifying the stability of dynamical systems is a central and challenging task in control theory and systems analysis. To tackle these problems we present an algorithmic approach…