Michele Barbato

According to our database, Michele Barbato authored at least 16 papers between 2016 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Sub-Tree Scheduling for Wireless Sensor Networks With Partial Coverage: Complexity and Polynomial-Size Formulations.

Michele Barbato, Nicola Bianchessi

Networks, April, 2025

2024

A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses.

Michele Barbato, Alberto Ceselli, Giovanni Righini

J. Sched., August, 2024

The Hamiltonian p-median problem: Polyhedral results and branch-and-cut algorithms.

Michele Barbato, Luís Gouveia

Eur. J. Oper. Res., 2024

Mathematical programming for simultaneous feature selection and outlier detection under l1 norm.

Michele Barbato, Alberto Ceselli

Eur. J. Oper. Res., 2024

Mathematical Programming Algorithms for Convex Hull Approximation with a Hyperplane Budget.

Michele Barbato, Alberto Ceselli, Rosario Messana

CoRR, 2024

2023

Node based compact formulations for the Hamiltonian <i>p</i>-median problem.

Michele Barbato, Francisco Canas, Luís Gouveia, Pierre Pesneau

Networks, December, 2023

On the impact of resource relocation in facing health emergencies.

Michele Barbato, Alberto Ceselli, Marco Premoli

Eur. J. Oper. Res., July, 2023

Box-total dual integrality and edge-connectivity.

Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini

Math. Program., January, 2023

On the Complexity of Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage.

Michele Barbato, Nicola Bianchessi

CoRR, 2023

2022

The Schrijver system of the flow cone in series-parallel graphs.

Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini, Roberto Wolfler Calvo

Discret. Appl. Math., 2022

2021

Monopolar graphs: Complexity of computing classical graph parameters.

Michele Barbato, Dario Bezzi

Discret. Appl. Math., 2021

2020

On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs.

Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2018

Lexicographical polytopes.

Michele Barbato, Roland Grappe, Mathieu Lacroix, Clément Pira

Discret. Appl. Math., 2018

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

PhD thesis, 2016

Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks.

Michele Barbato, Roland Grappe, Mathieu Lacroix, Roberto Wolfler Calvo

Discret. Optim., 2016

A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks.

Michele Barbato, Roland Grappe, Mathieu Lacroix, Roberto Wolfler Calvo

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016