Computational aspects of the maximum diversity problem

Authors:
Jay B. Ghosh
Affiliations:
Faculty of Business Administration, Bilkent University, 06533 Bilkent, Ankara, Turkey
Venue:
Operations Research Letters
Year:
1996

Citing 6
Cited 11

Computational aspects of a branch and bound algorithm for quadratic zero-one programming

Computing
A GRASP for a difficult single machine scheduling problem

Computers and Operations Research
Topics in Parellel Computing in Mathematical Programming

Topics in Parellel Computing in Mathematical Programming
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Lexicographic bottleneck problems

Operations Research Letters
Semi-greedy heuristics: An empirical study

Operations Research Letters

New heuristics for the maximum diversity problem

Journal of Heuristics
Competitive Hopfield network combined with estimation of distribution for maximum diversity problems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
Hybrid heuristics for the maximum diversity problem

Computational Optimization and Applications
A hybrid GRASP with data mining for the maximum diversity problem

HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
GRASP with path-relinking for the maximum diversity problem

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Path-relinking intensification methods for stochastic local search algorithms

Journal of Heuristics
Approximation algorithms for maximum dispersion

Operations Research Letters
SkyDiver: a framework for skyline diversification

Proceedings of the 16th International Conference on Extending Database Technology
Heuristics and metaheuristics for the maximum diversity problem

Journal of Heuristics
GRASP and path relinking for the equitable dispersion problem

Computers and Operations Research
A tabu search based memetic algorithm for the maximum diversity problem

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address two variations of the maximum diversity problem which arises when m elements are to be selected from an n-element population based on inter-element distances. We study problem complexity and propose randomized greedy heuristics. Performance of the heuristics is tested on a limited basis.