๐Ÿ‘ฉ๐Ÿปโ€๐Ÿ’ป I am Eleonora and I am a PostDoc at Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), USI - SUPSI.

โœ๐Ÿป I am part in the OC Group, lead by Luca Maria Gambardella and Monaldo Mastrolilli. My interests involve theoretical an practical hardness of combinatorial optimization problems.

๐Ÿ” You can find me at:

โญ ResearchGate

โญ Google Scholar

โญ ORCID

NEWS

๐Ÿš€ Our paper The Integrality Gap of the Traveling Salesman Problem is 4/3 if the LP Solution Has at Most n+6 Non-zero Components has been accepted at IPCO 2026!

๐Ÿš€ I have been invited to participate in the Dagstuhl Seminar Analysis of Algorithms Beyond the Worst Case. A big thank you to the organizers for this great opportunity!

๐Ÿš€ The OC Group will host the EUROYoung Workshop 2026 in Lugano!

๐Ÿš€ Our paper On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach has been accepted for publication at Discrete Optimization!

Publications and submitted works

Journal papers

  • ๐Ÿ“ Vercesi, E., Barta, J., Gambardella, L. M., Gualandi, S., & Mastrolilli, M. (2025). On the integrality gap of small Asymmetric Traveling Salesman Problems: A polyhedral and computational approach. Discrete Optimization, 57, 100901.
  • ๐Ÿ“ Bernardelli, A. M., Bonasera, L., Duma, D., & Vercesi, E. (2024). Multi-objective stochastic scheduling of inpatient and outpatient surgeries. Flexible Services and Manufacturing Journal, 1โ€“55.
  • ๐Ÿ“ Vercesi, E., Gualandi, S., Mastrolilli, M., & Gambardella, L. M. (2023). On the generation of metric TSP instances with a large integrality gap by branch-and-cut. Mathematical Programming Computation, 15(2), 389โ€“416.
  • ๐Ÿ“ Gualandi, S., Vercesi, E., & Toscani, G. (2022). A kinetic description of the body size distribution of species. Mathematical Models and Methods in Applied Sciences, 32(14), 2853โ€“2885.

Conference papers

  • ๐Ÿ“ Villa, T., Vercesi, E., Barta, J., & Mastrolilli, M. (2025). The Integrality Gap of the Traveling Salesman Problem is 4/3 if the LP Solution Has at Most n+6 Non-zero Components. The 27th Conference on Integer Programming and Combinatorial Optimization (IPCO).
  • ๐Ÿ“ Encz, K. I., Mastrolilli, M., & Vercesi, E. (2025). Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes. The 52nd EATCS International Colloquium on Automata, Languages, and Programming (ICALP).
  • ๐Ÿ“ Gambardella, L. M., Gualandi, S., Mastrolilli, M., & Vercesi, E. (2022). Predicting the Empirical Hardness of Metric TSP Instances. Workshop on Operations Research and Data Science in Public Services, 1โ€“16. Springer.

Under Review

  • ๐Ÿ“ Huber, S., Mastrolilli, M., & Vercesi, E. The falsification problem: How hard is it to falsify heuristics? (Preprint available upon request).
  • ๐Ÿ“ Bernardelli, A. M., Vercesi, E., Gambardella, L. M., Gualandi, S., & Mastrolilli, M. Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem. link
  • ๐Ÿ“ Vercesi, E., & Buchanan, A. The Dantzigโ€“Fulkersonโ€“Johnson TSP formulation is easy to solve for few subtour constraints. link

CV

You can download my CV here
Last update: 2026/01/19

Teaching

If you need any of the material I use during lectures, just write me an e-mail.

Deep Learning Lab FW 2024/2025

Universitร  della Svizzera Italiana, Master in Artifical Intelligence

The students will acquire hands-on experience with Deep Learning in Python using PyTorch.
Two seminars session will be organized during the course
- Seminars from PhD students attending the course
- Seminars from PostDoc/senior researchers from IDSIA

USI students interested in this course can contact the Dean Office of Informatics.
Other interested students can contact me directly.

Thesis proposal for Master and Bachelor students


- Bachelor thesis, research thesis
- Bachelor thesis, non-research thesis
- Master thesis, research thesis
- Master thesis, non-research thesis

Students interested in doing their thesis with me / us can contact me directly.

Blog

This section is dedicated to some tutorials that I wrote for my self, but that can be of interest for other people as well. Here, I will also add some unpublished code that I have used for my research.