Michele Barbato

17 papers C 2Journal 13Unranked 1
YearRankTypeTitle / Venue / Authors
2025 — conf
PriSM: A Privacy-Friendly Support Vector Machine.
ESORICS (1)
Michele Barbato, Alberto Ceselli, Sabrina De Capitani di Vimercati, Sara Foresti, Pierangela Samarati
2025 J jnl
Sub-Tree Scheduling for Wireless Sensor Networks With Partial Coverage: Complexity and Polynomial-Size Formulations.
Networks
Michele Barbato, Nicola Bianchessi
2024 J jnl
A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses.
J. Sched.
Michele Barbato, Alberto Ceselli, Giovanni Righini
2024 J jnl
Mathematical Programming Algorithms for Convex Hull Approximation with a Hyperplane Budget.
CoRR
Michele Barbato, Alberto Ceselli, Rosario Messana
2024 J jnl
Mathematical programming for simultaneous feature selection and outlier detection under l1 norm.
Eur. J. Oper. Res.
Michele Barbato, Alberto Ceselli
2024 J jnl
The Hamiltonian p-median problem: Polyhedral results and branch-and-cut algorithms.
Eur. J. Oper. Res.
Michele Barbato, Luís Gouveia
2023 J jnl
Box-total dual integrality and edge-connectivity.
Math. Program.
Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini
2023 J jnl
Node based compact formulations for the Hamiltonian
Networks
Michele Barbato, Francisco Canas, Luís Gouveia, Pierre Pesneau
2023 J jnl
On the Complexity of Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage.
CoRR
Michele Barbato, Nicola Bianchessi
2023 J jnl
On the impact of resource relocation in facing health emergencies.
Eur. J. Oper. Res.
Michele Barbato, Alberto Ceselli, Marco Premoli
2022 J jnl
The Schrijver system of the flow cone in series-parallel graphs.
Discret. Appl. Math.
Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini, Roberto Wolfler Calvo
2021 J jnl
Monopolar graphs: Complexity of computing classical graph parameters.
Discret. Appl. Math.
Michele Barbato, Dario Bezzi
2020 C conf
On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs.
ISCO
Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini
2018 J jnl
Lexicographical polytopes.
Discret. Appl. Math.
Michele Barbato, Roland Grappe, Mathieu Lacroix, Clément Pira
2016 C conf
A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks.
ISCO
Michele Barbato, Roland Grappe, Mathieu Lacroix, Roberto Wolfler Calvo
2016 J jnl
Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks.
Discret. Optim.
Michele Barbato, Roland Grappe, Mathieu Lacroix, Roberto Wolfler Calvo
2016 — —
Une approche polyédrale pour le problème du double voyageur de commerce sous contraintes de piles et pour les ordres lexicographiques. (A Polyhedral Approach for the Double TSP with Multiple Stacks and Lexicographical Orders).
Michele Barbato