Abstract
Diversity maximization is concerned with selecting a subset of a predetermined number of elements that are as diverse as possible. In recent years, there has been a growing interest in the maximum diversity problem with respect to both solution method and practical application. We propose two constructive and two destructive heuristic algorithms for generating suboptimal solutions of his quality to the problem quickly. The special procedures are tested in a simulation study and the empirical results are subject to a standard statistical analysis.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
