A new algorithm for general matching problems using network flow subproblems.
Réjean LessardJean-Marc RousseauMichel MinouxPublished in: Networks (1989)
Keyphrases
- network flow
- matching algorithm
- np hard
- search space
- benchmark problems
- objective function
- optimization algorithm
- learning algorithm
- computational complexity
- cost function
- worst case
- simulated annealing
- linear programming
- min cost
- optimization model
- minimum cost
- ant colony optimization
- multi objective
- special case
- evolutionary algorithm
- social network analysis
- optimization problems
- branch and bound algorithm
- upper bound
- dynamic programming
- globally optimal
- partial solutions