Maximum weight relaxed cliques and Russian Doll Search revisited.
Timo GschwindStefan IrnichIsabel PodlinskiPublished in: Discret. Appl. Math. (2018)
Keyphrases
- maximum weight
- russian doll search
- weighted graph
- constraint satisfaction
- constraint propagation
- lower bound
- bipartite matching
- minimum weight
- bipartite graph
- np hard
- independent set
- optimal solution
- partial order
- optimization problems
- constraint satisfaction problems
- shortest path
- graph structure
- edge weights
- maximal cliques
- minimum spanning tree
- random variables
- knapsack problem
- constraint programming
- evolutionary algorithm