Fast exact algorithms for the maximum diversity problem

DOI10.1016/J.EJOR.2025.11.014MaRDI QIDQ7233347zbMATH OpenFDO

Authors Jinping Lei, Lu Liu, Mingyu Xiao, Yi Zhou

Publication date 27 April 2026

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2025.11.014

zbMATH Keywords

branch and boundcombinatorial optimizationmaixmum diversity problemsemidefinite programming

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• t-linearization for the maximum diversity problem
• A branch and bound algorithm for the maximum diversity problem
• A review on discrete diversity and dispersion maximization from an OR perspective
• A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
• An exact cutting plane method for the Euclidean max-sum diversity problem
• Computational aspects of the maximum diversity problem
• Diverse data selection under fairness constraints
• Heuristic algorithms for the maximum diversity problem
• Memetic self-adaptive evolution strategies applied to the maximum diversity problem
• Optimal results and tight bounds for the Maximum Diversity Problem
• The equitable dispersion problem
• Upper bounds and exact algorithms for \(p\)-dispersion problems

This page was built for publication: Fast exact algorithms for the maximum diversity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233347)