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. The falsification problem: How hard is it to falsify heuristics?

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

   2026
2. 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

   2025
3. Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes

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

   2025
4. Predicting the Empirical Hardness of Metric TSP Instances

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

   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
3. TSP with prediction

   M. Elias, F. Grandoni, A. Polak, and 1 more author