Publications and submitted works

Journal papers

• 📝 Encz, K. I., Mastrolilli, M., Vercesi, E. (2026). Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes. Mathematics of Operations Research.
• 📝 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

• 📝 Huber, S., Mastrolilli, M., Vercesi, E., The falsification problem: How hard is it to falsify heuristics? (2026). 9th International Symposium on Combinatorial Optimization. (Preprint available upon request).
• 📝 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

• 📝 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
• 📝 Elias, M., Grandoni, F., Polak, A., Vercesi, E. TSP with prediction. (Forty-third International Conference on Machine Learning.)

CV

Last update: 2026/03/03

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.