On optimality of a polynomial algorithm for random linear multidimensional assignment problem.
Pavlo A. KrokhmalPublished in: Optim. Lett. (2011)
Keyphrases
- np hard
- learning algorithm
- worst case
- detection algorithm
- optimal solution
- dynamic programming
- computational complexity
- cost function
- optimization algorithm
- preprocessing
- recognition algorithm
- clustering method
- simulated annealing
- improved algorithm
- randomly generated
- linear complexity
- high accuracy
- probabilistic model
- computational cost
- significant improvement
- objective function
- least squares
- neural network
- theoretical analysis
- segmentation algorithm
- experimental evaluation
- k means
- matching algorithm
- times faster
- evolutionary algorithm
- lower bound
- similarity measure
- curve fitting