8 citations · 24 across the 17 of their papers we have counts for
4 papers · 1 filter
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…
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…
An Approach to Constrained Polynomial Optimization via Nonnegative Circuit Polynomials and Geometric Programming
Mareike Dressler, Sadik Iliman, Timo de Wolff
In this article we combine two developments in polynomial optimization. On the one hand, we consider nonnegativity certificates based on sums of nonnegative circuit polynomials, wh…
Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming
Sadik Iliman, Timo de Wolff
In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnega…