Paolo Ventura

According to our database, Paolo Ventura authored at least 32 papers between 2002 and 2024.

Collaborative distances:

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

2024

Preface: 18th Cologne-Twente Workshop on graphs and combinatorial optimization (CTW 2020).

Claudio Gentile, Gaia Nicosia, Andrea Pacifici, Giuseppe Stecca, Paolo Ventura

Discret. Appl. Math., 2024

A MaxSAT approach for solving a new Dynamic Discretization Discovery model for train rescheduling problems.

Anna Livia Croella, Bjørnar Luteberget, Carlo Mannino, Paolo Ventura

Comput. Oper. Res., 2024

2023

The realization-independent reallocation heuristic for the stochastic container relocation problem.

Tiziano Bacci, Sara Mattia, Paolo Ventura

Soft Comput., April, 2023

2022

Disruption Management in Railway Systems by Safe Place Assignment.

Anna Livia Croella, Veronica Dal Sasso, Leonardo Lamorgese, Carlo Mannino, Paolo Ventura

Transp. Sci., 2022

Optimal patchings for consecutive ones matrices.

Marc E. Pfetsch, Giovanni Rinaldi, Paolo Ventura

Math. Program. Comput., 2022

Easy Cases of Deadlock Detection in Train Scheduling.

Veronica Dal Sasso, Leonardo Lamorgese, Carlo Mannino, Antonio Tancredi, Paolo Ventura

Oper. Res., 2022

2021

Strengthened clique-family inequalities for the stable set polytope.

Adam N. Letchford, Paolo Ventura

Oper. Res. Lett., 2021

The Tick Formulation for deadlock detection and avoidance in railways traffic control.

Veronica Dal Sasso, Leonardo Lamorgese, Carlo Mannino, Andrea Onofri, Paolo Ventura

J. Rail Transp. Plan. Manag., 2021

2020

Generalized Periodic Vehicle Routing and Maritime Surveillance.

Maria Fleischer Fauske, Carlo Mannino, Paolo Ventura

Transp. Sci., 2020

A branch-and-cut algorithm for the restricted Block Relocation Problem.

Tiziano Bacci, Sara Mattia, Paolo Ventura

Eur. J. Oper. Res., 2020

2019

Single courier single restaurant meal delivery (without routing).

Matteo Cosmi, Gianpaolo Oriolo, Veronica Piccialli, Paolo Ventura

Oper. Res. Lett., 2019

The bounded beam search algorithm for the block relocation problem.

Tiziano Bacci, Sara Mattia, Paolo Ventura

Comput. Oper. Res., 2019

2018

A New Lower Bound for the Block Relocation Problem.

Tiziano Bacci, Sara Mattia, Paolo Ventura

Proceedings of the Computational Logistics - 9th International Conference, 2018

2017

An improved integer linear programming formulation for the closest 0-1 string problem.

Claudio Arbib, Mara Servilio, Paolo Ventura

Comput. Oper. Res., 2017

2016

One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model.

Claudio Arbib, Fabrizio Marinelli, Paolo Ventura

Int. Trans. Oper. Res., 2016

Optimum Solution of the Closest String Problem via Rank Distance.

Claudio Arbib, Giovanni Felici, Mara Servilio, Paolo Ventura

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

2014

The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect.

Anna Galluccio, Claudio Gentile, Paolo Ventura

J. Comb. Theory B, 2014

The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect.

Anna Galluccio, Claudio Gentile, Paolo Ventura

J. Comb. Theory B, 2014

2013

A heuristic and an exact method for the gate matrix connection cost minimization problem.

Luigi De Giovanni, G. Massi, Ferdinando Pezzella, Marc E. Pfetsch, Giovanni Rinaldi, Paolo Ventura

Int. Trans. Oper. Res., 2013

22-clique-bond of stable set polyhedra.

Anna Galluccio, Claudio Gentile, Paolo Ventura

Discret. Appl. Math., 2013

2011

The stable set polytope of claw-free graphs with stability number greater than three.

Anna Galluccio, Claudio Gentile, Paolo Ventura

Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

2010

The stable set polytope of claw-free graphs with large stability number.

Anna Galluccio, Claudio Gentile, Paolo Ventura

Electron. Notes Discret. Math., 2010

2009

Gear Composition of Stable Set Polytopes and G-Perfection.

Anna Galluccio, Claudio Gentile, Paolo Ventura

Math. Oper. Res., 2009

The k-Gear Composition and the Stable Set Polytope.

Anna Galluccio, Claudio Gentile, M. Macina, Paolo Ventura

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

Gear composition and the stable set polytope.

Anna Galluccio, Claudio Gentile, Paolo Ventura

Oper. Res. Lett., 2008

The stable set polytope of quasi-line graphs.

Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura

Comb., 2008

On the Stable Set Polytope of Claw-Free Graphs.

Anna Galluccio, Claudio Gentile, Paolo Ventura

Proceedings of the Combinatorial Optimization and Applications, 2008

2006

Mod-2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets.

Claudio Gentile, Paolo Ventura, Robert Weismantel

SIAM J. Discret. Math., 2006

2005

Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs.

Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2003

A compact linear program for testing optimality of perfect matchings.

Paolo Ventura, Friedrich Eisenbrand

Oper. Res. Lett., 2003

Primal separation for 0/1 polytopes.

Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura

Math. Program., 2003

2002

0/1 optimization and 0/1 primal separation are equivalent.

Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002