array(1) { [0]=> object(Apache_Solr_Document)#24 (3) { ["_documentBoost":protected]=> bool(false) ["_fields":protected]=> array(6) { ["content_id"]=> array(1) { [0]=> string(14) "DIRECTORY_5616" } ["content_title"]=> array(1) { [0]=> string(13) "PAOLO VENTURA" } ["description"]=> array(1) { [0]=> string(19979) "

Nome: Paolo Ventura

Nato a Roma il 13 agosto 1971

Indirizzo: c/o IASI-CNR, Via dei Taurini, 19; 00185 Roma

Tel: +39 06 4993 7122

Fax: +39 06 4993 7137

E-mail: paolo.ventura@iasi.cnr.it

Carriera

Dal marzo 2005, ricercatore presso l'Ististuto di Analisi dei Sistemi ed Informatica "A. Ruberti" del CNR (IASI-CNR).
Dal 2002 al marzo 2005, assegnista di ricerca prewsso l'Ististuto di Analisi dei Sistemi ed Informatica "A. Ruberti" del CNR (IASI-CNR).

Studi

Maggio 2002. Dottorato di Ricerca in Ricerca Operativa presso l'Università La Sapienza di Roma.
Luglio 1997. Laurea in Ingegneria Gestionale presso l'Università Tor Vergata di Roma.

Scuole di perfezionamento

DONET Spring School in Computational Combinatorial Optimization. Schloss Dagstuhl, Germania, 15-19 maggio 2000;
ADONET/CIM Doctoral Summer School on Geometric and Algebraic Approaches to Integer Programming. Lisbona, 11-15 luglio 2005.
IASI/ADONET Robust Optimization Summer School. Cortina D’ Ampezzo, 2-6 luglio 2007.

Publicazioni

C. Arbib, M. Servilio, and P. Ventura, “An improved integer linear pro- gramming formulation for the closest 0-1 string problem”, C. Arbib, M. Servilio e P. Ventura. Computers and Operations Research, Volume 80 (2017), pp. 94-100. DOI: 10.1016/j.cor.2016.11.019.
C. Arbib, G. Felici, M. Servilio e P. Ventura, “Optimum Solution of the Closest String Problem via Rank Distance”. ISCO 2016, Lecture Notes in Computer Science, Volume 9849 (2016), pp. 297-30. DOI: 10.1007/978- 3-319-45587-7 26.
C. Arbib, F. Marinelli e 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 Oper- ational Research, Volume 11 (2014), pp. 47-63.
A. Galluccio, C. Gentile e 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, Volume 108 (2014), pp. 1-28.
A. Galluccio, C. Gentile e P. Ventura, “The stable set polytope of claw- free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect”. Journal of Combinatorial Theory, Series B, Volume 107 (2014), pp. 92-122.
L. De Giovanni, G. Massi, F. Pezzella, M.E. Pfetsch, G. Rinaldi e P. Ventura, “A heuristic and an exact method for the gate matrix connection cost minimization problem”. International Transactions in Operational Research, Volume 20, Issue 5 (2013), pp. 627-643.
A. Galluccio, C. Gentile e P. Ventura, “2-clique-bond of stable set polyhedra”. Discrete Applied Mathematics, Volume 161 (2013), pp. 1988- 2000.
Y. Faenza, G. Oriolo, G. Stauffer e 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 e P. Ventura, “ Stable set in claw-free graphs: recent achievement and future challenges”. Optima, Volume 86 (2011), pp. 1-8.
A. Galluccio, C. Gentile e P. Ventura, “The stable set polytope of claw-free graphs with stability number greater than three”. In Operations Research Proceedings 2011, Selected Papers of the International Confer- ence on Operations Research (OR 2011), August 30 - September 2, 2011, Zurich, Switzerland, Schmedders K., Luethi H.-J., Klatte D. eds., Operations Research Proceedings, Springer Heidelberg Germania, 47-52, 2012.
A. Galluccio, C. Gentile e P. Ventura, “The stable set polytope of claw- free graphs with large stability number”. In Electronic Notes in Discrete Mathematics, ISCO 2010 International Symposium on Combinatorial Optimization, 2010.
A. Galluccio, C. Gentile e P. Ventura, “Gear composition of stable set polytopes and G-perfection”. Mathematics of Operations Research, Volume 34 (2009), pp. 813-836.
A. Galluccio, C. Gentile e P. Ventura, “On the stable set polytope of claw-free graphs”. COCOA 2008, Lecture Notes in Computer Science, Volume 5165 (2008), pp. 339-350.
A. Galluccio, C. Gentile e P. Ventura, “Gear composition and the Stable Set Polytope”. Operations Research Letters, Volume 36 (2008), pp. 419-423.
F. Eisenbrand, G. Oriolo, G. Stauffer e P. Ventura, “The stable set polytope of quasi-line graphs”. Combinatorica, Volume 28(1) (2008), pp. 45-67.
C. Gentile, P. Ventura e R. Weismantel, “Mod2 cuts generation yields the convex hull of bounded integer feasible sets”. SIAM journal on discrete mathematics, Volume 20 (2006), pp. 913-919.
F. Eisenbrand, G. Oriolo, G. Stauffer e P. Ventura, “Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs”, IPCO XI, Lecture Notes in Computer Science, Volume 3509 (2005), pp. 291-305.
F. Eisenbrand e P. Ventura, “A compact linear program for testing optimality of perfect matchings”. Operations Research Letters, Volume 31 (2003), pp. 429-434.
F. Eisenbrand, G. Rinaldi e P. Ventura, “Primal separation for 0/1 polytopes”. Mathematical Programming, Volume 95 (2003), pp. 475-491.
F. Eisenbrand, G. Rinaldi e P. Ventura, “0/1 Optimization and 0/1 Primal Separation are Equivalent”. Proceedings of SODA ’02, pp. 920- 926.
P. Ventura, “Some contributions to primal and dual separation for inte- ger programming”. Tesi di Dottorato in Ricerca Operativa presso l'Università La Sapienza odi Roma, 2002.

Altre pubblicazioni

A. Galluccio, C. Gentile, M. Macina, and P. Ventura, “The k-gear com- position and the stable set polytope”. In the Proceedings of 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Paris, June 2-4, Liberti L., Cafieri S., Mucherino A., Nannicini G., Tarissan F. eds., 2009.

Visiting periods

Ricercatore visitatore presso laTechnische Universitat, Berlin, 16 giugno - 16 luglio 2012.
Ricercatore visitatore presso l'École Polytechnique Fédérale de Lausanne, 15 giugno- 15 luglio2010.
Ricercatore visitatore presso la Otto-von-Guericke University of Magdeburg, 1-30 aprile 2007.
Ricercatore visitatore presso l'École Polytechnique Fédérale de Lausanne, 14 gennaio - 15 febbraio 2006.
Ricercatore visitatore presso il Max Planck Institut fur Informatik of Saarbruecken, luglio - agosto 2003.
Ricercatore visitatore presso il Max Planck Institut fur Informatik of Saarbruecken, 11 marzo - 9 maggio 2002.

Teaching activity

Corso di “Metodi e Modelli per L’ Ottimizzazione Discreta (I parte)” presso l'Università Tor Vergata di Roma, AA.AA.2008/2009–2014/2015.
Corso di “Ricerca Operativa 1-2 (II parte)” presso l'Università Tor Vergata di Roma, A.A. 2007/2008.
Corso of “Ricerca Operativa 2” presso l'Università Tor Vergata di Roma, AA.AA. 2003/2004 - 2006/2007.
Corso di “Ricerca Operativa” presso l'Università Tor Vergata di Roma, A.A. 2002/2003.
Assistente del corso di “Calcolatori Elettronici” del Prof. S. Salza, presso l'Università La Sapienza di Roma; A.A. 2000/2001.
Corso di “Progettazione Ottima” per il Master “Metodi di Ottimizzazione e Data Mining” organizzato dall'Università dell’Aquila; febbraio-marzo 2008.
Corso di “Algorithms for resource location, scheduling and minimization of times and costs” per i “Master in Project Management” organizzati dell'Università Roma Tre di Roma e dallo IASI-CNR; gennaio-marzo 2004 e 2006.
Corso di “Ricerca Operativa” per gli stuidenti del ”Liceo Scientifico Statale J.F. Kennedy” di Roma, organizzato nell'ambito del progetto ”Alternanza Scuola Lavoro” del Ministero dell’ Istruzione, Università e Ricerca, AA.AA. 2005/2006, 2006/2007 e 2007/2008.
Corso intensivo “Solving Linear Integer Problems with Cplex on Linux Platforms”, organizzato dallo IASI-CNR; ottobre 2003.

Other

Dal 2010 membro della steering committee dell'annuale Cargese Workshop on Combinatorial Optimization.
Membro del comitato organizzatore della IASI/ADONET Robust Optimization Summer School. Cortina D’ Ampezzo, 2-6 luglio 2007.
Referee per le riviste Mathematics of Operations Research, Mathematical Programming, 4OR, Algorithmica, European Journal of Operational Research, Journal of Discrete Algorithms e Discrete Mathematics.

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 4993 7137

E-mail: paolo.ventura@iasi.cnr.it

Scientific Career

From March 2005 todate, researcher at the Institute of System Analysis and Computer Science of the National Research Council (IASI-CNR).
From 2002 to March 2005, Post Doctoral position at the Institute of System Analysis and Computer Science of the National Research Council (IASI-CNR).

Studies

May 2002. Ph. D. in Operations Reasearch at the University La Sapienza of Rome.
July 1997. Master Degree in Ingegneria Gestionale at the University Tor Vergata of Rome.

Schools

DONET Spring School in Computational Combinatorial Optimization. Schloss Dagstuhl, Germany, May 15-19, 2000;
ADONET/CIM Doctoral Summer School on Geometric and Algebraic Approaches to Integer Programming. Lisbon, July 11-15, 2005.
IASI/ADONET Robust Optimization Summer School. Cortina D’ Ampezzo, Italy, July 2-6, 2007.

Publications

C. Arbib, M. Servilio, and P. Ventura, “An improved integer linear pro- gramming formulation for the closest 0-1 string problem”, C. Arbib, M. Servilio, and P. Ventura. Computers and Operations Research, Volume 80 (2017), pp. 94-100. DOI: 10.1016/j.cor.2016.11.019.
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-30. DOI: 10.1007/978- 3-319-45587-7 26.
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 Oper- ational Research, Volume 11 (2014), 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, Volume 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”. Journal of Combinatorial Theory, Series B, Volume 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, Volume 20, Issue 5 (2013), pp. 627-643.
A. Galluccio, C. Gentile, and P. Ventura, “2-clique-bond of stable set polyhedra”. Discrete Applied Mathematics, Volume 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, Volume 86 (2011), pp. 1-8.
A. Galluccio, C. Gentile, and P. Ventura, “The stable set polytope of claw-free graphs with stability number greater than three”. In Operations Research Proceedings 2011, Selected Papers of the International Confer- ence on Operations Research (OR 2011), August 30 - September 2, 2011, Zurich, Switzerland, Schmedders K., Luethi H.-J., Klatte D. eds., Operations Research Proceedings, Springer Heidelberg Germania, 47-52, 2012.
A. Galluccio, C. Gentile, and P. Ventura, “The stable set polytope of claw- free graphs with large stability number”. In Electronic Notes in Discrete Mathematics, ISCO 2010 International Symposium on Combinatorial Optimization, 2010.
A. Galluccio, C. Gentile, and P. Ventura, “Gear composition of stable set polytopes and G-perfection”. Mathematics of Operations Research, Volume 34 (2009), pp. 813-836.
A. Galluccio, C. Gentile, and P. Ventura, “On the stable set polytope of claw-free graphs”. COCOA 2008, Lecture Notes in Computer Science, Volume 5165 (2008), pp. 339-350.
A. Galluccio, C. Gentile, and P. Ventura, “Gear composition and the Stable Set Polytope”. Operations Research Letters, Volume 36 (2008), pp. 419-423.
F. Eisenbrand, G. Oriolo, G. Stauffer, and P. Ventura, “The stable set polytope of quasi-line graphs”. Combinatorica, Volume 28(1) (2008), pp. 45-67.
C. Gentile, P. Ventura, and R. Weismantel, “Mod2 cuts generation yields the convex hull of bounded integer feasible sets”. SIAM journal on discrete mathematics, Volume 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, Volume 3509 (2005), pp. 291-305.
F. Eisenbrand and P. Ventura, “A compact linear program for testing optimality of perfect matchings”. Operations Research Letters, Volume 31 (2003), pp. 429-434.
F. Eisenbrand, G. Rinaldi, and P. Ventura, “Primal separation for 0/1 polytopes”. Mathematical Programming, Volume 95 (2003), pp. 475-491.
F. Eisenbrand, G. Rinaldi, and P. Ventura, “0/1 Optimization and 0/1 Primal Separation are Equivalent”. Proceedings of SODA ’02, pp. 920- 926.
P. Ventura, “Some contributions to primal and dual separation for inte- ger programming”. Ph.D. Thesis in Operation Research, University La Sapienza of Rome, 2002.

Other publications

A. Galluccio, C. Gentile, M. Macina, and P. Ventura, “The k-gear com- position and the stable set polytope”. In the Proceedings of 8th Cologne- Twente Workshop on Graphs and Combinatorial Optimization, Paris, June 2-4, Liberti L., Cafieri S., Mucherino A., Nannicini G., Tarissan F. eds., 2009.

Visiting periods

Visiting researcher at Technische Universitat, Berlin, June 16 - July 16 2012.
Visiting researcher at École Polytechnique Fédérale de Lausanne, June 15 - July 15 2010.
Visiting researcher at Otto-von-Guericke University of Magdeburg, April 1-30 2007.
Visiting researcher at École Polytechnique Fédérale de Lausanne, January 14 - February 15 2006.
Visiting researcher at Max Planck Institut fur Informatik of Saarbruecken, July - August 2003.
Visiting researcher at Max Planck Institut fur Informatik of Saarbruecken, March 11 - May 9, 2002.

Teaching activity

Course of “Metodi e Modelli per L’ Ottimizzazione Discreta (I parte)” at the University Tor Vergata of Rome, academic year 2008/2009–2014/2015.
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.
Teaching assistant of 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 University of l’Aquila; February- March 2008.
Course of “Algorithms for resource location, scheduling and minimization of times and costs” for the “Master in Project Management” organized by the University Roma Tre of Rome and the Istituto di Analisi dei Sistemi ed Informatica “A.Ruberti” of 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.
Intensive course of “Solving Linear Integer Problems with Cplex on Linux Platforms”, organized by the Istituto di Analisi dei Sistemi ed Informatica “A.Ruberti” of CNR; October 2003.

Other

Since 2010 up to date, member of the steering committee of the yearly Cargese Workshop on Combinatorial Optimization.
Member of the Organization Committee of the IASI/ADONET Robust Optimization Summer School. Cortina D’ Ampezzo, Italy, July 2-6, 2007.
Referee for Mathematics of Operations Research, Mathematical Programming, 4OR, Algorithmica, European Journal of Operational Research, Journal of Discrete Algorithms, and Discrete Mathematics.

a:0:{}" } ["meta_keywords"]=> array(1) { [0]=> string(1) "," } ["reserved"]=> array(1) { [0]=> string(1) "0" } ["auth_ip"]=> array(1) { [0]=> string(1) "0" } } ["_fieldBoosts":protected]=> array(6) { ["content_id"]=> bool(false) ["content_title"]=> bool(false) ["description"]=> bool(false) ["meta_keywords"]=> bool(false) ["reserved"]=> bool(false) ["auth_ip"]=> bool(false) } } }