) algorithm for a special case of the maximum cost-to-time ratio cycle problem and its coherence with an eigenproblem of a matrix.
Ján PlávkaPublished in: ZOR Methods Model. Oper. Res. (1992)
Keyphrases
- special case
- np hard
- computational complexity
- times faster
- preprocessing
- similarity measure
- computationally efficient
- expectation maximization
- cost function
- computational cost
- experimental evaluation
- worst case
- genetic algorithm
- dynamic programming
- significant improvement
- search space
- probabilistic model
- sparse matrix
- transportation problem
- total cost
- recognition algorithm
- clustering method
- detection algorithm
- optimization algorithm
- optimal solution
- particle swarm optimization
- matching algorithm
- bayesian networks
- theoretical analysis
- high accuracy
- matrix multiplication