Dr. Baldacci’s research focuses on the theoretical study, design, implementation, and evaluation of exact and heuristic algorithms for solving combinatorial optimization problems. His work addresses both general and application-specific problems, primarily in transportation and logistics. Methodologically, his research encompasses exact techniques such as dynamic programming, branch-and-bound, branch-and-cut, column generation, branch-price-and-cut, as well as heuristic and metaheuristic methods. In recent years, he has also undertaken literature surveys on routing problems. His current research interests include stochastic and distributionally robust optimization and the solution of large-scale linear programs with column-dependent rows.