Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem.
Daniel RehfeldtThorsten KochPublished in: SIAM J. Optim. (2019)
Keyphrases
- maximum weight
- np hard
- bipartite matching
- bipartite graph
- minimum weight
- independent set
- greedy heuristic
- partial order
- exact algorithms
- weighted graph
- branch and bound algorithm
- integer programming
- approximation algorithms
- randomly generated problem instances
- worst case
- scheduling problem
- lower bound
- optimal solution
- special case
- shortest path problem
- knapsack problem
- greedy algorithm
- upper bound
- evolutionary algorithm
- computational complexity
- objective function