Exact algorithms for budgeted prize-collecting covering subgraph problems

Nicola Morandi, Roel Leus, Hande Yaman. Exact algorithms for budgeted prize-collecting covering subgraph problems. Computers & OR, 144:105798, 2022. [doi]

Abstract

Abstract is missing.