Curriculum Vitae et Studiorum

Name: Paolo Ventura
Birth: Rome, 13th August 1971
Home address: Via Biella, 9;  00182  Rome, Italy
Office address: c/o IASI-CNR, Via dei Taurini, 19;  00185 Rome, Italy
Phone: +39 06 4993 7122
Fax: +39 06 49937137
E-mail: paolo.ventura@iasi.cnr.it

Scientific Career

• From March 2005 todate, researcher at the Institute of System Analysis and Computer Science “A. Ruberti” of the National Research Council (IASI-CNR).

• From 2002 to March 2005, Post Doctoral position at the Institute of System Analysis and Computer Science “A. Ruberti” of the National Research Council (IASI-CNR).

Studies

• May 2002. Ph. D. in Operation Reasearch at the University "La Sapienza" of Rome.

• July 1998. Master Degree in Ingegneria Gestionale at the University "Tor Vergata" of Rome.

Publications

• A.N. Letchford and P. Ventura, ``Strengthened clique-family inequalities for the stable set polytope''. Operations Research Letters, 49(4) (2021) 586--589.

• V. Dal Sasso, L. Lamorgese, C. Mannino, A. Onofri, and P. Ventura, ``The Tick Formulation for deadlock detection and avoidance in railways traffic control''. Journal of Rail Transport Planning and Management, 17 (2021).

• M.E. Pfetsch, G.Rinaldi, and P. Ventura, ``Optimal patchings for consecutive ones matrices''. Mathematical Programming Computation, (2021).

• T. Bacci, S. Mattia, and P. Ventura, ``A branch-and-cut algorithm for the restricted Block Relocation Problem''. European Journal of Operational Research, 287(2) (2020), 452--459.

• M. Fleischer Fauske, C. Mannino, and P. Ventura ``Generalized Periodic Vehicle Routing and Maritime Surveillance''. Transportation Science, 54(1) (2020), 164--183.

• G. Oriolo, M. Cosmi, V. Piccialli, and P. Ventura, ``Single Courier Single Restaurant Meal Delivery (Without Routing)''. Operations Research Letters, 47 (2019) 537--541.

• T. Bacci, S. Conte, D. Matera, S. Mattia, and P. Ventura, ``A New Software System for Optimizing the Operations at a Container Terminal''. In Dell'Amico M., Gaudioso M., Stecca G. (eds) A View of Operations Research Applications in Italy, 2018. AIRO Springer Series, vol 2. Springer, Cham, pp. 41--50 (2019);

• T. Bacci, S. Mattia, and P. Ventura, ``The Bounded Beam Search algorithm for the Block Relocation Problem''. Computers and Operations Research, 103, pp. 252-264 (2019);

• T. Bacci, S. Mattia, and P. Ventura, ``A new lower bound for the Block Relocation Problem''. ICCL 2018, Lecture Notes in Computer Science, Volume 11184 (2018), pp. 168-174.

• T. Bacci, S. Mattia, and P. Ventura, ``Some complexity results for the Minimum Blocking Items Problem''. Springer Proceedings in Mathematics and Statistics, Volume 217 (2018), pp. 475-483;

• C. Arbib, M. Servilio, and P. Ventura, ``An improved integer linear programming formulation for the closest 0-1 string problem". Computers and Operations Research, Volume 80 (2017), pp. 94-100;

• C. Arbib, G. Felici, M. Servilio, and P. Ventura, ``Optimum Solution of the Closest String Problem via Rank Distance''. ISCO 2016, Lecture Notes in Computer Science, Volume 9849 (2016), pp. 297-307;

• C. Arbib, F. Marinelli, and P. Ventura, ``One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model''. International Transactions in Operational Research, Volume 11 (2016), pp. 47-63;

• A. Galluccio, C. Gentile, and P. Ventura, ``The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are GG-perfect''. Journal of Combinatorial Theory, Series B, 108 (2014), pp. 1–28.
  

• A. Galluccio, C. Gentile, and P. Ventura, ``The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect''. ournal of Combinatorial Theory, Series B, 107 (2014), pp. 92–122.
  

• L. De Giovanni, G. Massi, F. Pezzella, M.E. Pfetsch, G. Rinaldi, and P. Ventura, ``A heuristic and an exact method for the gate matrix connection cost minimization problem''. International Transactions in Operational Research, 20 (5) (2013), pp. 627–643.
  

• A. Galluccio, C. Gentile, and P. Ventura, “2-clique-bond of stable set polyhedra”. Discrete Applied Mathematics, 161 (2013), pp. 1988-2000.
  

• Y. Faenza, G. Oriolo, G. Stauffer, and P. Ventura, “Stable Sets in Claw-Free Graphs: A Journey Through Algorithms and Polytopes”. In Progress in Combinatorial Optimization, R. Majoub, Wiley (2011).     
  

• G. Oriolo, G. Stauffer, and P. Ventura, “ Stable set in claw-free graphs: recent achievement and future challenges”. Optima, 86:1-8 (2011). (Invited survey).
  

• A. Galluccio, C. Gentile, and P. Ventura, “Gear composition of stable set polytopes and G-perfection”. Mathematics of Operations Research, 34 (2009), pp. 813:836.
  

• A. Galluccio , C. Gentile and P. Ventura, “On the stable set polytope of claw-free graph”. COCOA 2008, Lecture Notes in Computer Science, 5165 (2008), pp. 339-350.

• A. Galluccio , C. Gentile and P. Ventura, “Gear composition and the Stable Set Polytope”. Operations Research Letters, 36 (2008), pp. 419-423.

• F. Eisenbrand, G. Oriolo, G. Stauffer, and P. Ventura, “The stable set polytope of quasi-line graphs”.Combinatorica, Vol.28, N. 1 (2008), pp. 45-67.

• A. Galluccio, C. Gentile, and P. Ventura, “Gear composition of stable set polytopes and G-perfection”. Technical Report n. 661 (May 2007) of Istituto di Analisi dei Sistemi ed Informatica “A. Ruberti'' del CNR (ISSN 1128-3378).

• C. Gentile, P. Ventura, and R. Weismantel, “Mod2 cuts generation yields the convex hull of bounded integer feasible sets”. SIAM journal on discrete mathematics, 20 (2006), pp. 913-919.

• F. Eisenbrand, G. Oriolo, G. Stauffer, and P. Ventura, “Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs”, IPCO XI, Lecture Notes in Computer Science, 3509 (2005) pp. 291-305.

• F. Eisenbrand and P. Ventura, “A compact linear program for testing optimality of perfect matching”. Operations Research Letters, 31 (2003), pp. 429.434.

• F. Eisenbrand, G. Rinaldi, and P. Ventura, “Primal separation for 0/1 polytopes”. Mathematical Programming, Vol 95 (2003), pp. 475-491.

• F. Eisenbrand, G. Rinaldi, and P. Ventura, “0/1 Optimization and 0/1 Primal Separation are Equivalent”. SODA '02, pp. 920-926.

• P. Ventura, “Some contributions to primal and dual separation for integer programming”. Ph.D. Thesis in Operation Research, 2002.

Teaching activity

• Course of “Ricerca Operativa" at the University “Tor Vergata” of Rome, academic year 2017/2018-2021/2022.

• Course of “Metodi e Modelli per L' Ottimizzazione Discreta (I parte)” at the University “Tor Vergata” of Rome, academic year 2008/2009-2017/2018.

• Course of “Ricerca Operativa 1-2 (II parte)” at the University “Tor Vergata” of Rome, academic year 2007/2008.

• Course of “Ricerca Operativa 2” at the University “Tor Vergata” of Rome, academic years 2003/2004, 2004/2005, 2005/2006, and 2006/2007.

• Course of “Ricerca Operativa” at the University “Tor Vergata” of Rome; academic year 2002/2003.

• Collaboration with the course of Electronic Calculators of Prof. S. Salza, at the University “La Sapienza” of Rome; academic year 2000/2001.

• Course of “Progettazione Ottima” for the Master “Metodi di Ottimizzazione e Data Mining” organized by the University of l'Aquila; February-March 2008.

• Course of “Algorithms for resource location, scheduling and minimization of times and costs” for the Master “Project Management” organized by the University “Roma Tre” of Rome and the Istituto di Analisi dei Sistemi ed Informatica “A.Ruberti” del CNR; January-March 2004 and 2006.

• Course of “Ricerca Operativa” for the students of “Liceo Scientifico Statale J.F. Kennedy” of Rome, within the project “Alternanza Scuola Lavoro” of “Ministero dell' Istruzione, Università e Ricerca”, academic years 2005/2006, 2006/2007, and 2007/2008.

• Course of “Solving Linear Integer Problems with Cplex on Linux Platforms”, at the Istituto di Analisi dei Sistemi ed Informatica “A.Ruberti” del CNR; October 2003.

Others

• Since 2019, member of the steering committee of the yearly Aussois Combinatorial Optimization Workshop (http://www.iasi.cnr.it/aussois/web/home).

• Since 2010, member of the steering committee of the yearly Cargese Workshop on Combinatorial Optimization (http://www.iasi.cnr.it/~ventura/Cargese19/Overview.html).

• Member of the Organization Committee of the IASI/ADONET Robust Optimization Summer School. Cortina D' Ampezzo, Italy, July 2-6, 2007.

File translated from T_EX by T _TH, version 2.77.
On 15 Sep 2006, 12:58.