Paolo Ventura

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 17

Top Topics

Deadlock Detection

Integer Linear Programming

Top Venues

Comput. Oper. Res.

Oper. Res. Lett.

J. Comb. Theory, Ser. B

Publications

Claudio Gentile, Gaia Nicosia, Andrea Pacifici, Giuseppe Stecca, Paolo Ventura
Preface: 18th Cologne-Twente Workshop on graphs and combinatorial optimization (CTW 2020). Discret. Appl. Math. 354 (2024)
Anna Livia Croella, Bjørnar Luteberget, Carlo Mannino, Paolo Ventura
A MaxSAT approach for solving a new Dynamic Discretization Discovery model for train rescheduling problems. Comput. Oper. Res. 167 (2024)
Tiziano Bacci, Sara Mattia, Paolo Ventura
The realization-independent reallocation heuristic for the stochastic container relocation problem. Soft Comput. 27 (7) (2023)
Veronica Dal Sasso, Leonardo Lamorgese, Carlo Mannino, Antonio Tancredi, Paolo Ventura
Easy Cases of Deadlock Detection in Train Scheduling. Oper. Res. 70 (4) (2022)
Tiziano Bacci, Sara Mattia, Paolo Ventura
The Bounded Beam Search algorithm for the Block Relocation Problem. CoRR (2022)
Anna Livia Croella, Veronica Dal Sasso, Leonardo Lamorgese, Carlo Mannino, Paolo Ventura
Disruption Management in Railway Systems by Safe Place Assignment. Transp. Sci. 56 (4) (2022)
Marc E. Pfetsch, Giovanni Rinaldi, Paolo Ventura
Optimal patchings for consecutive ones matrices. Math. Program. Comput. 14 (1) (2022)
Adam N. Letchford, Paolo Ventura
Strengthened clique-family inequalities for the stable set polytope. Oper. Res. Lett. 49 (4) (2021)
Veronica Dal Sasso, Leonardo Lamorgese, Carlo Mannino, Andrea Onofri, Paolo Ventura
The Tick Formulation for deadlock detection and avoidance in railways traffic control. J. Rail Transp. Plan. Manag. 17 (2021)
Maria Fleischer Fauske, Carlo Mannino, Paolo Ventura
Generalized Periodic Vehicle Routing and Maritime Surveillance. Transp. Sci. 54 (1) (2020)
Tiziano Bacci, Sara Mattia, Paolo Ventura
A branch-and-cut algorithm for the restricted Block Relocation Problem. Eur. J. Oper. Res. 287 (2) (2020)
Tiziano Bacci, Sara Mattia, Paolo Ventura
The bounded beam search algorithm for the block relocation problem. Comput. Oper. Res. 103 (2019)
Matteo Cosmi, Gianpaolo Oriolo, Veronica Piccialli, Paolo Ventura
Single courier single restaurant meal delivery (without routing). Oper. Res. Lett. 47 (6) (2019)
Tiziano Bacci, Sara Mattia, Paolo Ventura
A New Lower Bound for the Block Relocation Problem. ICCL (2018)
Claudio Arbib, Mara Servilio, Paolo Ventura
An improved integer linear programming formulation for the closest 0-1 string problem. Comput. Oper. Res. 80 (2017)
Claudio Arbib, Fabrizio Marinelli, Paolo Ventura
One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model. Int. Trans. Oper. Res. 23 (1-2) (2016)
Claudio Arbib, Giovanni Felici, Mara Servilio, Paolo Ventura
Optimum Solution of the Closest String Problem via Rank Distance. ISCO (2016)
Anna Galluccio, Claudio Gentile, Paolo Ventura
The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect. J. Comb. Theory, Ser. B 107 (2014)
Anna Galluccio, Claudio Gentile, Paolo Ventura
The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect. J. Comb. Theory, Ser. B 108 (2014)
Anna Galluccio, Claudio Gentile, Paolo Ventura
22-clique-bond of stable set polyhedra. Discret. Appl. Math. 161 (13-14) (2013)
Luigi De Giovanni, G. Massi, Ferdinando Pezzella, Marc E. Pfetsch, Giovanni Rinaldi, Paolo Ventura
A heuristic and an exact method for the gate matrix connection cost minimization problem. Int. Trans. Oper. Res. 20 (5) (2013)
Anna Galluccio, Claudio Gentile, Paolo Ventura
The stable set polytope of claw-free graphs with stability number greater than three. OR (2011)
Anna Galluccio, Claudio Gentile, Paolo Ventura
The stable set polytope of claw-free graphs with large stability number. Electron. Notes Discret. Math. 36 (2010)
Anna Galluccio, Claudio Gentile, M. Macina, Paolo Ventura
The k-Gear Composition and the Stable Set Polytope. CTW (2009)
Anna Galluccio, Claudio Gentile, Paolo Ventura
Gear Composition of Stable Set Polytopes and G-Perfection. Math. Oper. Res. 34 (4) (2009)
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
The stable set polytope of quasi-line graphs. Comb. 28 (1) (2008)
Anna Galluccio, Claudio Gentile, Paolo Ventura
On the Stable Set Polytope of Claw-Free Graphs. COCOA (2008)
Anna Galluccio, Claudio Gentile, Paolo Ventura
Gear composition and the stable set polytope. Oper. Res. Lett. 36 (4) (2008)
Claudio Gentile, Paolo Ventura, Robert Weismantel
Mod-2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets. SIAM J. Discret. Math. 20 (4) (2006)
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. IPCO (2005)
Paolo Ventura, Friedrich Eisenbrand
A compact linear program for testing optimality of perfect matchings. Oper. Res. Lett. 31 (3) (2003)
Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura
Primal separation for 0/1 polytopes. Math. Program. 95 (3) (2003)
Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura
0/1 optimization and 0/1 primal separation are equivalent. SODA (2002)