A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints.
Temel ÖncanI. Kuban AltinelPublished in: Electron. Notes Discret. Math. (2018)
Keyphrases
- branch and bound algorithm
- minimum cost
- np hard
- capacity constraints
- precedence constraints
- lower bound
- lagrangian relaxation
- approximation algorithms
- randomly generated
- branch and bound
- undirected graph
- network flow
- network flow problem
- optimal solution
- lower bounding
- spanning tree
- upper bound
- integer variables
- scheduling problem
- np complete
- special case
- upper bounding
- matching algorithm
- randomly generated problems
- computational complexity
- combinatorial optimization
- constraint satisfaction
- single machine scheduling problem
- linear programming
- lower and upper bounds
- worst case
- linear program
- integer programming
- constraint programming
- finding an optimal solution
- knapsack problem
- constraint satisfaction problems
- bipartite graph
- graph matching