Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Eleonora Vercesi
Observed names:
Eleonora, Vercesi,
Vercesi, Eleonora
Institutions:
University of Applied Sciences and Arts of Southern Switzerland,
Dalle Molle Institute for Artificial Intelligence Research,
Università della Svizzera italiana
Observed institutions:
University of Applied Sciences and Arts of Southern Switzerland,
University of Pavia,
Dalle Molle Institute for Artificial Intelligence Research,
Università della Svizzera italiana
ORCID:
0000-0002-1621-2484
Observed ORCID:
0000-0002-1621-2484
OpenAlex ID:
A5088620645
The Gene Mover's Distance: Single-cell similarity via Optimal Transport
2021
·
Bellazzi, Riccardo
, Codegoni, Andrea
, et al.
·
arXiv (Cornell University)
·
28
PDF
Multi-objective stochastic scheduling of inpatient and outpatient surgeries
2024
·
Ambrogio Maria Bernardelli
, Lorenzo Bonasera
, et al.
·
Flexible Services and Manufacturing Journal
·
20
On the generation of metric TSP instances with a large integrality gap by branch-and-cut
2023
·
Eleonora Vercesi
, Stefano Gualandi
, et al.
·
Mathematical Programming Computation
·
14
PDF
A kinetic description of the body size distribution of species
2022
·
Stefano Gualandi
, Eleonora Vercesi
, et al.
·
Mathematical Models and Methods in Applied Sciences
·
5
PDF
Branch-And-Bound Algorithms as Polynomial-Time Approximation Schemes
2025
·
Encz, Koppány István
, Mastrolilli, Monaldo
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
4
PDF
The Integrality Gap of the Traveling Salesman Problem is $$\frac{4}{3}$$ if the LP Solution Has at Most $$n + 6$$ Non-Zero Components
2026
·
Tullio Villa
, Eleonora Vercesi
, et al.
·
Lecture notes in computer science
·
2
The Integrality Gap of the Traveling Salesman Problem is $4/3$ if the LP Solution Has at Most $n+6$ Non-zero Components
2025
·
Villa, Tullio
, Vercesi, Eleonora
, et al.
·
arXiv (Cornell University)
·
2
PDF
On the integrality gap of small Asymmetric Traveling Salesman Problems: A polyhedral and computational approach
2025
·
Eleonora Vercesi
, Janos Barta
, et al.
·
Discrete Optimization
·
2
Integrality gap preserving reductions
2026
·
Encz, Koppány István
, Mastrolilli, Monaldo
, et al.
·
arXiv (Cornell University)
·
1
PDF
Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
2024
·
Bernardelli, Ambrogio Maria
, Vercesi, Eleonora
, et al.
·
arXiv (Cornell University)
·
1
PDF
Single-Cell Gene Expression Profiles for Classification Problems
2021
·
Gualandi, Stefano
, Codegoni, Andrea
, et al.
·
Zenodo (CERN European Organization for Nuclear Research)
·
1
TSP instances that require exponentially many subtour elimination constraints
2026
·
Vercesi, Eleonora
, Buchanan, Austin
·
arXiv (Cornell University)
The Falsification Problem: How Hard Is It to Falsify Heuristics?
2026
·
Stefano Huber
, Monaldo Mastrolilli
, et al.
·
Lecture notes in computer science
The Dantzig–Fulkerson–Johnson TSP Formulation Is Easy to Solve for Few Subtour Constraints
2026
·
Eleonora Vercesi
, Austin Buchanan
·
INFORMS Journal on Optimization
TSP with Predictions: Heatmap to Tour with Provable Guarantees
2026
·
Eliáš, Marek
, Grandoni, Fabrizio
, et al.
·
arXiv (Cornell University)
PDF
Data used in the paper "TSP with predictions: heatmap to tour with provable guarantees"
2026
·
Marek, Eliáš
, Fabrizio, Grandoni
, et al.
·
Zenodo (CERN European Organization for Nuclear Research)
Branch-and-Bound Algorithms as Polynomial-Time Approximation Schemes
2026
·
Koppány István Encz
, Monaldo Mastrolilli
, et al.
·
Mathematics of Operations Research
Predicting the Empirical Hardness of Metric TSP Instances
2023
·
Luca Maria Gambardella
, Stefano Gualandi
, et al.
·
AIRO Springer series/AIRO Springer Series
Show more works
View as search
Works count:
18
Citation count:
80
H-index:
4
I10-index:
3
Year
Topic
Type