Dr. Baldacci is Associate Professor of Operations Research at the College of Science and Engineering, Hamad Bin Khalifa University (HBKU), Doha, Qatar. Prior to joining HBKU, he has been an Associate Professor of Operations Research at the Department of Electrical, Electronic, and Information Engineering “Guglielmo Marconi” (DEI), University of Bologna, Italy (2005-2022), Assistant Professor of Operations Research, Department of Engineering Sciences and Methods (DISMI), University of Modena and Reggio Emilia, Italy (2001-2005), and Postdoctoral Research Associate, Centre for Quantitative Finance, Imperial College, London, United Kingdom (2000-2001).
Dr. Baldacci’s research activity is mainly devoted to the theoretical study, design, implementation and the evaluation of exact and heuristic algorithms for the solution of combinatorial optimization problems. Particular attention has been reserved both to general problems and to specific problems, mainly with applications in transportation and logistics. From a methodological point of view, the research has considered both exact techniques, based on dynamic programming, branch-and-bound, branch-and-cut, column generation, branch-price-and-cut, and heuristic and metaheuristic techniques. In recent years, Dr. Baldacci has also performed an activity of literature survey on routing problems. Current research interests also include stochastic and distributional robust optimization, and the solution of large-scale linear programs with column-dependent-rows.
He is on the editorial board of Operations Research - INFORMS, and he has published more than 50 papers in Mathematical Programming, Operations Research, Computers and Operations Research, European Journal of Operational Research, Computational Management Science, 4OR, Journal of Operational Research Society, Journal of Heuristics, Transportation Science, Networks, Annals of Operations Research, Discrete Applied Mathematics and INFORMS Journal on Computing.
Dr. Baldacci has more than 20 years of teaching experience at all levels (BSc, MSc and PhD). He has also supervised several first cycle degree programmes, second cycle degree programmes, and PhD students. Recently, he has been very active in organizing PhD courses and schools. He has been a member of the University Research Evaluation Committee (VRA), responsible for coordinating and monitoring the research evaluation activities, Area 01, Mathematical Sciences, University of Bologna. He is on the editorial board of Operations Research – INFORMS.
Other than the academic experiences reported in the biography, Dr. Baldacci also acts as the scientific consultant on optimization and management problems for various industries and public organizations. He was, and continues to be involved in the design and development of advanced exact/heuristic algorithms for the solution of real-world combinatorial optimization problems for several companies. Dr. Baldacci has been the co-founder of two companies specialized in the design of decision support systems for logistics and supply chain management.
Imperial College, University of London, United Kingdom.
1998University of Bologna, Italy.
1994“Routing Optimization with Generalized Consistency Requirements.” Transportation Science 56, no. 1: 223–44, 2022.
2022“A Benders Decomposition Approach for the Multivehicle Production Routing Problem with Order-up-to-Level Policy.” Transportation Science 55, no. 1: 160–78, 2021.
2021“A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems.” INFORMS Journal on Computing 32, no. 2: 428–43, 2020.
2020“Optimal Solution of Vehicle Routing Problems with Fractional Objective Function.” Transportation Science, 2020.
2020“Routing Optimization with Time Windows under Uncertainty.” Mathematical Programming 175, no. 1–2: 263–305, 2019.
2019“The Vehicle Routing Problem with Transhipment Facilities.” Transportation Science 51, no. 2: 592–606, 2017.
2017“An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem.” Operations Research 61, no. 2: 298–314, 2013.
2013“New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem.” Operations Research 59, no. 5: 1269–83, 2011.
2011“An Exact Algorithm for the Pickup and Delivery Problem with Time Windows.” Operations Research 59, no. 2: 414–26, 2011.
2011“An Exact Algorithm for the Period Routing Problem.” Operations Research 59, no. 1: 228–41, 2011.
2011“A Unified Exact Method for Solving Different Classes of Vehicle Routing Problems.” Mathematical Programming 120, no. 2: 347–80, 2009.
2009“An Exact Algorithm for the Vehicle Routing Problem Based on the Set Partitioning Formulation with Additional Cuts.” Mathematical Programming 115, no. 2: 351–85, 2008.
2008“The Capacitated m -Ring-Star Problem.” Operations Research 55, no. 6: 1147–62, 2007.
2007“An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation.” Operations Research 52, no. 5: 723–38, 2004.
2004