Curriculum Vitae Dr. Enrico Bartolini

Curriculum VitaeDr. Enrico BartoliniDepartment of Science and Methods for Engineering (DISMI)University of Modena and Reggio EmiliaVia Amendola 2, Pad. Morselli, 42122, Reggio Emilia, ItalyEmail: enrico.bartolini@unimore.itEDUCATION2006 – 2009 Ph.D. in Computer ScienceUniversity of Bologna, Department of Computer Science, Bologna, ItalyThesis: “Algorithms for network design and routing problems”Date: April 2009Supervisor: Prof. V. Maniezzo2000 – 2005 M.Sc. in Computer ScienceUniversity of Bologna, C.d.L. in Scienze dell’Informazione,Cesena, Italy (Final mark: 110/110, cum laude)Thesis: “Algoritmi Euristici per il Network Design ”(in Italian)Date: October 2005Supervisor: Prof. A. MingozziRESEARCH POSITIONS01/2013 – present Research fellowDISMI, University of Modena and Reggio Emilia, ItalySupervisor: Prof. M. Dell’Amico01/2012 – 12/2012 Research fellowDepartment of Mathematics, University of Bologna, ItalySupervisor: Prof. A. Mingozzi01/2010 – 12/2011 Post-doctoral fellowHEC Montréal, and CIRRELT, Montréal, CanadaSupervisors: Prof. G. Laporte and Prof. J.-F. Cordeau02/2009 – 12/2009 Research fellowDepartment of Mathematics, University of Bologna, ItalySupervisor: Prof. A. MingozziRESEARCH GRANTS & CONTRACTS• Research project with Polo scientifico-didattico di Cesena, University of Bologna (11/2005 – 02/2006).Title of the project: “Ottimizzazione di reti tecnologiche”;1

• Member of the research project “PRIN 2008” of the MIUR (Italian National Research ProgrammeStrategic Projects). Title of the project “Models and Algorithms for Combinatorial OptimizationProblems in Transportation and Logistic Systems”.RESEARCH VISITS06/2008 – 08/2008 Visiting Ph.D. studentCIRRELT, Montréal, CanadaSupervised by Prof. J.-F. Cordeau22–29/11/2009 Visiting researcherAOC Team, LIPN - Laboratoire d’Informatique de Paris-NordInstitut Galilee, Université Paris 13, Villetaneuse, FranceSupervised by Prof. R. Wolfler CalvoRESEARCH INTERESTSEnrico Bartolini’s research is in Operations Research, and Combinatorial Optimization. His main interestsare in the study of both exact, and heuristic methods for the solution of structured integer linearprogramming problems. He is particularly interested in the study and development of lower bounds, andexact solution algorithms that are based on column generation and decomposition methods, and theirintegration with dynamic programming, and cutting plane methods. From an application viewpoint,he devoted major attention to problems arising in the context of logistics, distribution management,and telecommunications such as capacitated vehicle routing problems (both node routing, and arc routingproblems), and network design problems. Enrico Bartolini is author of several scientific papers ininternational journals including Mathematical Programming and Operations Research.PUBLICATIONS[1] Bartolini E., J.-F. Cordeau, and G. Laporte, “An exact algorithm for the capacitated arc routingproblem with deadheading demand”, Operations Research, 2013, 61: 315-327.[2] Bartolini E., J.-F. Cordeau, and G. Laporte, “Improved lower bounds and exact algorithm for thecapacitated arc routing problem”, Mathematical Programming, Ser. A, 2013, 137: 409-452.[3] Baldacci R., E. Bartolini, A. Mingozzi, and A. Valletta, “An exact algorithm for the period vehiclerouting problem”, Operations Research, 2011, 59: 228-241.2

[4] Baldacci R., E. Bartolini, and A. Mingozzi, “An exact algorithm for the pickup and delivery problemwith time windows”, Operations Research, 2011, 59: 414-426.[5] Baldacci R., E. Bartolini, A. Mingozzi, and R. Roberti, “An Exact Framework for a Broad Classof Vehicle Routing Problems”, Computational Management Science, 2010, 7: 229-268.[6] Baldacci R., E. Bartolini, and G. Laporte, “Some applications of the generalized vehicle routingproblem”, Journal of the Operational Research Society, 2010, 61: 1072-1077.[7] Bartolini E. and A. Mingozzi, “Algorithms for the non-bifurcated network design problem”, Journalof Heuristics, 2009, 15: 259-281.[8] Bartolini E., V. Maniezzo, and A. Mingozzi. “An adaptive memory-based approach based on partialenumeration”. In V. Maniezzo, R. Battiti, and J.-P. Watson, editors, Learning and IntelligentOptimization, Lecture Notes in Computer Science. Springer Berlin / Heidelberg, 2008.WORKING PAPERS & TECHNICAL REPORTS[9] Bartolini E., and A. Mingozzi, “The Single Vehicle Dial-A-Ride Problem”, Submitted for publication.THESES[11] Bartolini E., “Algorithms for Network Design and Routing Problems (PhD Thesis)”, TechnicalReport UBLCS-2009-02, Department of Computer Science, University of Bologna, March 2009.Available online at http://www.cs.unibo.it/pub/TR/UBLCS/ABSTRACTS/2009.bib[12] Bartolini E., “Algoritmi Euristici per il Network Design” (MsC Thesis, in Italian), ALMA MATERSTUDIORUM, Universitá di Bologna, Sede di Cesena, Facoltá di Scienze Matematiche, Fisiche eNaturali, Corso di Laurea in Scienze dell’ Informazione, Anno Accademico 2004-2005, II sessione.PARTICIPATION TO CONFERENCES & WORKSHOPS• 21st International Symposium on Mathematical Programming, 19–24 August 2012, Berlin, Germany.“The Single Vehicle Dial-A-Ride Problem”.3

• VEROLOG 2012: The first meeting of the EURO working Group on Vehicle Routing and LogisticsOptimization, 18–20 June 2012, Bologna, Italy. “An exact algorithm for the capacitated arc routingproblem with deadheading demand”.• Optimization Days, 2–4 May 2011, HEC Montréal, Canada. “Improved lower bounds for the capacitatedarc routing problem”.• XL Annual Conference of the Italian Operational Research Society, 8–11 September 2009, Siena, Italy.“The Split Delivery Vehicle Routing Problem”.• 20th International Symposium on Mathematical Programming, 23–28 August 2009, Chicago, Illinois.“An exact algorithm for the pickup and delivery problem with time windows”.• 23rd European Conference on Operational Research, 5–8 July 2009, Bonn, Germany. “An exact algorithmfor the pickup and delivery problem with time windows”.• XXXIX Annual Conference of Italian Operational Research Society, 8–11 September 2008, Ischia, Italy.“An exact algorithm for the pickup and delivery problem with time windows”.• LION 2007 II, Learning and Intelligent Optimization, 8–12 December 2007, Trento, Italy. “An AdaptiveMemory-Based Approach Based on Partial Enumeration”.• Matheuristics 2006, 27–30 August 2006, Bertinoro, Italy. “Heuristic Algorithms for the Non-BifurcatedNetwork Design Problem”.ORGANIZATION ACTIVITIESMember of local organization committee: “Matheuristics 2008: 2nd Workshop on Mathematical Contributionsto Metaheuristics”, 16-18 June 2008, University of Bologna Residential Center, Bertinoro,Italy.PROFESSIONAL ACTIVITIESReviewer for Operations Research, Transportation Science, European Journal of Operational Research,Discrete Applied Mathematics, Operations Research Letters, EURO Journal on Transportation and Logistics,International Transactions in Operational Research, Networks.4

TEACHINGAY 2009/2010Module-lecturer for the courseCombinatorial Optimization (Prof. A. Mingozzi)University of Bologna, C.d.L. in Scienze dell’Informazione, Cesena, Italy.AY 2006/2007AY 2006/2007AY 2007/2008Teaching Assistant for the courseOperations Research I (Prof. A. Mingozzi)University of Bologna, C.d.L. in Scienze dell’Informazione, Cesena, Italy.Teaching Assistant for the courseAlgorithms and Data Structures (Prof. V. Maniezzo)University of Bologna, C.d.L. in Informatica, Bologna, Italy.TECHNICAL SKILLSProgramming: C, C++, Fortran 77Optimization Tools: CPLEXText editing:LATEXLANGUAGESItalianEnglishMother tongueFluent5