A simple and effective algorithm for the MaxMin diversity problem.
Daniel Cosmin PorumbelJin-Kao HaoFred W. GloverPublished in: Ann. Oper. Res. (2011)
Keyphrases
- improved algorithm
- experimental evaluation
- cost function
- computational complexity
- input data
- preprocessing
- single pass
- np hard
- dynamic programming
- highly efficient
- learning algorithm
- convergence rate
- high accuracy
- optimization algorithm
- search space
- tree structure
- theoretical analysis
- computationally efficient
- particle swarm optimization
- detection algorithm
- linear programming
- matching algorithm
- worst case
- hybrid algorithm
- computational cost
- feature space
- premature convergence
- significant improvement
- straight forward