Paolo Ventura

34 papers A* 1B 1C 3Journal 27Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Digital twins for intelligent cities: the case study of Matera.
J. Reliab. Intell. Environ.
Riccardo De Benedictis, Amedeo Cesta, Riccardo Pellegrini, Matteo Diez, Diego Maria Pinto, Paolo Ventura, Giuseppe Stecca, Giovanni Felici, Andreas Scalas, Michela Mortara, Daniela Cabiddu, Simone Pittaluga, Michela Spagnuolo, Stefano Silvestri, Emanuele Damiano, Mario Sicuranza, Mario Ciampi, Gabriella Tognola, Lucanos Strambini, Roberto Malvezzi, Ida G. Presta, Marialucia Camardelli, Giordana Castelli, Emilio Fortunato Campana
2024 J jnl
A MaxSAT approach for solving a new Dynamic Discretization Discovery model for train rescheduling problems.
Comput. Oper. Res.
Anna Livia Croella, Bjørnar Luteberget, Carlo Mannino, Paolo Ventura
2024 J jnl
Preface: 18th Cologne-Twente Workshop on graphs and combinatorial optimization (CTW 2020).
Discret. Appl. Math.
Claudio Gentile, Gaia Nicosia, Andrea Pacifici, Giuseppe Stecca, Paolo Ventura
2023 J jnl
The realization-independent reallocation heuristic for the stochastic container relocation problem.
Soft Comput.
Tiziano Bacci, Sara Mattia, Paolo Ventura
2022 J jnl
Disruption Management in Railway Systems by Safe Place Assignment.
Transp. Sci.
Anna Livia Croella, Veronica Dal Sasso, Leonardo Lamorgese, Carlo Mannino, Paolo Ventura
2022 J jnl
Easy Cases of Deadlock Detection in Train Scheduling.
Oper. Res.
Veronica Dal Sasso, Leonardo Lamorgese, Carlo Mannino, Antonio Tancredi, Paolo Ventura
2022 J jnl
Optimal patchings for consecutive ones matrices.
Math. Program. Comput.
Marc E. Pfetsch, Giovanni Rinaldi, Paolo Ventura
2022 J jnl
The Bounded Beam Search algorithm for the Block Relocation Problem.
CoRR
Tiziano Bacci, Sara Mattia, Paolo Ventura
2021 J jnl
Strengthened clique-family inequalities for the stable set polytope.
Oper. Res. Lett.
Adam N. Letchford, Paolo Ventura
2021 J jnl
The Tick Formulation for deadlock detection and avoidance in railways traffic control.
J. Rail Transp. Plan. Manag.
Veronica Dal Sasso, Leonardo Lamorgese, Carlo Mannino, Andrea Onofri, Paolo Ventura
2020 J jnl
A branch-and-cut algorithm for the restricted Block Relocation Problem.
Eur. J. Oper. Res.
Tiziano Bacci, Sara Mattia, Paolo Ventura
2020 J jnl
Generalized Periodic Vehicle Routing and Maritime Surveillance.
Transp. Sci.
Maria Fleischer Fauske, Carlo Mannino, Paolo Ventura
2019 J jnl
Single courier single restaurant meal delivery (without routing).
Oper. Res. Lett.
Matteo Cosmi, Gianpaolo Oriolo, Veronica Piccialli, Paolo Ventura
2019 J jnl
The bounded beam search algorithm for the block relocation problem.
Comput. Oper. Res.
Tiziano Bacci, Sara Mattia, Paolo Ventura
2018 — conf
A New Lower Bound for the Block Relocation Problem.
ICCL
Tiziano Bacci, Sara Mattia, Paolo Ventura
2017 J jnl
An improved integer linear programming formulation for the closest 0-1 string problem.
Comput. Oper. Res.
Claudio Arbib, Mara Servilio, Paolo Ventura
2016 J jnl
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.
Claudio Arbib, Fabrizio Marinelli, Paolo Ventura
2016 C conf
Optimum Solution of the Closest String Problem via Rank Distance.
ISCO
Claudio Arbib, Giovanni Felici, Mara Servilio, Paolo Ventura
2014 J jnl
The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect.
J. Comb. Theory B
Anna Galluccio, Claudio Gentile, Paolo Ventura
2014 J jnl
The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect.
J. Comb. Theory B
Anna Galluccio, Claudio Gentile, Paolo Ventura
2013 J jnl
22-clique-bond of stable set polyhedra.
Discret. Appl. Math.
Anna Galluccio, Claudio Gentile, Paolo Ventura
2013 J jnl
A heuristic and an exact method for the gate matrix connection cost minimization problem.
Int. Trans. Oper. Res.
Luigi De Giovanni, G. Massi, Ferdinando Pezzella, Marc E. Pfetsch, Giovanni Rinaldi, Paolo Ventura
2011 — conf
The stable set polytope of claw-free graphs with stability number greater than three.
OR
Anna Galluccio, Claudio Gentile, Paolo Ventura
2010 J jnl
The stable set polytope of claw-free graphs with large stability number.
Electron. Notes Discret. Math.
Anna Galluccio, Claudio Gentile, Paolo Ventura
2009 J jnl
Gear Composition of Stable Set Polytopes and G-Perfection.
Math. Oper. Res.
Anna Galluccio, Claudio Gentile, Paolo Ventura
2009 C conf
The k-Gear Composition and the Stable Set Polytope.
CTW
Anna Galluccio, Claudio Gentile, M. Macina, Paolo Ventura
2008 J jnl
Gear composition and the stable set polytope.
Oper. Res. Lett.
Anna Galluccio, Claudio Gentile, Paolo Ventura
2008 C conf
On the Stable Set Polytope of Claw-Free Graphs.
COCOA
Anna Galluccio, Claudio Gentile, Paolo Ventura
2008 J jnl
The stable set polytope of quasi-line graphs.
Comb.
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
2006 J jnl
Mod-2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets.
SIAM J. Discret. Math.
Claudio Gentile, Paolo Ventura, Robert Weismantel
2005 B conf
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs.
IPCO
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
2003 J jnl
A compact linear program for testing optimality of perfect matchings.
Oper. Res. Lett.
Paolo Ventura, Friedrich Eisenbrand
2003 J jnl
Primal separation for 0/1 polytopes.
Math. Program.
Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura
2002 A* conf
0/1 optimization and 0/1 primal separation are equivalent.
SODA
Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura