Scholar
Eleonora Vercesi
Google Scholar ID: idh_se8AAAAJ
Università della Svizzera Italiana
Combinatorial Optimization
Travelling Salesman Problem
Complexity
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
46
H-index
3
i10-index
2
Publications
12
Co-authors
0
Publications
6 items
Integrality gap preserving reductions
2026
Cited
0
TSP with Predictions: Heatmap to Tour with Provable Guarantees
2026
Cited
0
The Integrality Gap of the Traveling Salesman Problem is $4/3$ if the LP Solution Has at Most $n+6$ Non-zero Components
2025
Cited
0
On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
2025
Cited
0
Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
2025
Cited
0
On the integrality gap of the Complete Metric Steiner Tree Problem via a novel formulation
arXiv.org · 2024
Cited
0
