Drones represent a promising complement to delivery logistics. They offer a fundamentally different performance profile than conventional trucks. They have lower operating costs and higher speeds, at the expense of reduced range and capacity. In scenarios where these limitations are manageable, drones can fully replace traditional delivery trucks. However, in most practical applications, these complementary vehicle types should be strategically combined to leverage their respective operational strengths. This thesis mainly proposes exact mathematical optimization methods for routing problems with drones. The first chapter gives an overview of the literature on routing problems with drones, in the field of operations research, with an emphasis on exact optimization methods. We highlight the variety of problems addressed by researchers and the need to increase the size of the instances solved to optimality. The second chapter briefly recalls the concepts of mathematical programming required for understanding branch-cut-and-price algorithms. We also describe the branch-cut-and-price algorithm used in this thesis, including state-of-the-art components and the labeling algorithm used to solve the pricing problems. The third chapter addresses the Two-Echelon Vehicle Routing Problem with Drones. We propose a new set-partitioning model, in which partial routes corresponding to drone movements are enumerated using a dynamic program. We propose an adaptation of the well-known rounded capacity cuts, specifically tailored to address this problem. In addition, we propose a heuristic branch-cut-and-price based on the exact algorithm. Computational experiments show that the exact algorithm significantly increases the size of optimally solved instances. To further evaluate the model, the algorithm is then extended to address the Park-and-Loop Routing Problem. The fourth chapter addresses the Truck-based Drone Delivery Routing Problem with Time Windows. We develop an exact branch-cut-and-price algorithm and a labeling algorithm to solve the pricing subproblem. We compare two alternative pricing models defined on distinct graphs and show that they are non-dominated: the most effective choice depends on instance characteristics. Computational experiments exhibit the efficiency of the proposed approaches. We also propose new challenging instances with increased drone capacity. The fifth chapter studies a variant of the Vehicle Routing Problem with Time Windows, which integrates two operationally relevant features: flexible departure times from the depot and strict limits on route duration. Although more generic, this problem can be assimilated to a drone routing problem in which the route duration limits the drone’s range. We develop an exact branch-cut-and-price algorithm, featuring a bidirectional labeling algorithm as its primary component for solving the complex pricing subproblem. We also show how the related problem of minimizing total route duration can be treated. Computational experiments confirm the algorithm’s performance.