16 citations · 16 across the 3 of their papers we have counts for
3 papers
math.OC2026
Maximum Covering Network Design on Graphs with Low Connectivity: Dynamic Programming and Block-Cut Trees
Felix Rauh, Jannik Matuschke, Hande Yaman
Planning accessible public services such as health care, emergency response, and schools often requires not only choosing where to open facilities but also improving the network th…
math.OC2022★ 16 cited
The TSP with drones: The benefits of retraversing the arcs
Nicola Morandi, Roel Leus, Jannik Matuschke +1
In the Traveling Salesman Problem with Drones (TSP-mD), a truck and multiple drones cooperate to serve customers in the minimum amount of time. The drones are launched and retrieve…
math.OC2021
Exact algorithms for budgeted prize-collecting covering subgraph problems
Nicola Morandi, Roel Leus, Hande Yaman
We introduce a class of budgeted prize-collecting covering subgraph problems. For an input graph with prizes on the vertices and costs on the edges, the aim of these problems is to…