3 papers
cs.AI2024
Exact algorithms and heuristics for capacitated covering salesman problems
Lucas Porto Maziero, Fábio Luiz Usberti, Celso Cavellucci
This paper introduces the Capacitated Covering Salesman Problem (CCSP), approaching the notion of service by coverage in capacitated vehicle routing problems. In CCSP, locations wh…
eess.SY2021
Interruption flows for reliability evaluation of power distribution networks
Fabio Luiz Usberti, Celso Cavellucci, Christiano Lyra
Energy networks should strive for reliability. How can it be assessed, measured, and improved? What are the best trade-offs between investments and their worth? The flow-based fram…
cs.DS2021
Branch-and-cut algorithms for the covering salesman problem
Lucas Porto Maziero, Fábio Luiz Usberti, Celso Cavellucci
The Covering Salesman Problem (CSP) is a generalization of the Traveling Salesman Problem in which the tour is not required to visit all vertices, as long as all vertices are cover…