Exact algorithms for budgeted prize-collecting covering subgraph problems.
Nicola MorandiRoel LeusHande YamanPublished in: Comput. Oper. Res. (2022)
Keyphrases
- space complexity
- exact algorithms
- knapsack problem
- worst case
- exact solution
- prize collecting
- computational problems
- optimization problems
- combinatorial optimization
- approximation algorithms
- heuristic methods
- combinatorial optimization problems
- np complete
- search algorithm
- np hard
- search space
- vehicle routing problem with time windows
- benders decomposition
- lower bound