Journal Articles

1. Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes

   K. I. Encz, M. Mastrolilli, and E. Vercesi

   Mathematics of Operations Research 2026
2. On the integrality gap of small Asymmetric Traveling Salesman Problems: A polyhedral and computational approach

   E. Vercesi, J. Barta, L. M. Gambardella, and 2 more authors

   Discrete Optimization 2025
3. Multi-objective stochastic scheduling of inpatient and outpatient surgeries

   A. M. Bernardelli, L. Bonasera, D. Duma, and 1 more author

   Flexible Services and Manufacturing Journal 2024
4. On the generation of metric TSP instances with a large integrality gap by branch-and-cut

   E. Vercesi, S. Gualandi, M. Mastrolilli, and 1 more author

   Mathematical Programming Computation 2023
5. A kinetic description of the body size distribution of species

   S. Gualandi, E. Vercesi, and G. Toscani

   Mathematical Models and Methods in Applied Sciences 2022

Conference Papers

1. TSP with Predictions: Heatmap to Tour with Provable Guarantees

   Marek Elias, Fabrizio Grandoni, Adam Polak, and 1 more author

   In Proceedings of the 43rd International Conference on Machine Learning (ICML) 2026
2. The falsification problem: How hard is it to falsify heuristics?

   S. Huber, M. Mastrolilli, and E. Vercesi

   In 9th International Symposium on Combinatorial Optimization 2026
3. The Integrality Gap of the Traveling Salesman Problem is 4/3 if the LP Solution Has at Most n+6 Non-zero Components

   T. Villa, E. Vercesi, J. Barta, and 1 more author

   In Proceedings of the 27th Conference on Integer Programming and Combinatorial Optimization (IPCO) 2025
4. Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes

   K. I. Encz, M. Mastrolilli, and E. Vercesi

   In Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming (ICALP) 2025
5. Predicting the Empirical Hardness of Metric TSP Instances

   L. M. Gambardella, S. Gualandi, M. Mastrolilli, and 1 more author

   In Workshop on Operations Research and Data Science in Public Services 2022

Preprints

1. Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem

   A. M. Bernardelli, E. Vercesi, L. M. Gambardella, and 2 more authors
2. The Dantzig–Fulkerson–Johnson TSP formulation is easy to solve for few subtour constraints

   E. Vercesi, and A. Buchanan