Worst case examples of an exterior point algorithm for the assignment problem.
Charalampos PapamanthouKonstantinos PaparrizosNikolaos SamarasKonstantinos StergiouPublished in: Discret. Optim. (2008)
Keyphrases
- worst case
- np hard
- dynamic programming
- computational complexity
- theoretical analysis
- optimization algorithm
- matching algorithm
- learning algorithm
- probabilistic model
- times faster
- error bounds
- convergence rate
- detection algorithm
- improved algorithm
- space complexity
- average case
- particle swarm optimization
- computational cost
- experimental evaluation
- cost function
- k means
- evolutionary algorithm
- search space
- preprocessing
- simulated annealing
- linear programming
- high accuracy
- multi objective
- greedy algorithm
- recognition algorithm
- lower bound
- genetic algorithm