A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs.
Temel ÖncanM. Hakan AkyüzI. Kuban AltinelPublished in: INOC (2019)
Keyphrases
- branch and bound algorithm
- maximum weight
- np hard
- weighted graph
- lower bound
- branch and bound
- minimum weight
- independent set
- bipartite graph
- lower bounding
- optimal solution
- bipartite graph matching
- upper bound
- partial order
- single machine scheduling problem
- combinatorial optimization
- upper bounding
- precedence constraints
- scheduling problem
- pairwise
- shortest path
- special case
- approximation algorithms
- search algorithm
- greedy heuristic
- genetic algorithm
- finding an optimal solution
- spanning tree
- minimum cost
- graph structure
- graph matching
- worst case
- evolutionary algorithm