Eleonora Vercesi

Orcid: 0000-0002-1621-2484

According to our database1, Eleonora Vercesi authored at least 8 papers between 2021 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
The Integrality Gap of the Traveling Salesman Problem is $\frac{4}{3}$ if the LP Solution Has at Most n + 6 Non-Zero Components.
Proceedings of the Integer Programming and Combinatorial Optimization, 2026

2025
The Integrality Gap of the Traveling Salesman Problem is 4/3 if the LP Solution Has at Most n+6 Non-zero Components.
CoRR, July, 2025

On the integrality gap of small Asymmetric Traveling Salesman Problems: A polyhedral and computational approach.
Discret. Optim., 2025

Branch-And-Bound Algorithms as Polynomial-Time Approximation Schemes.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024
On the integrality gap of the Complete Metric Steiner Tree Problem via a novel formulation.
CoRR, 2024

2023
On the generation of metric TSP instances with a large integrality gap by branch-and-cut.
Math. Program. Comput., June, 2023

2022
A kinetic description of the body size distributions of species.
CoRR, 2022

2021
The Gene Mover's Distance: Single-cell similarity via Optimal Transport.
CoRR, 2021


  Loading...