An exact cutting plane method for the Euclidean max-sum diversity problem

DOI10.1016/J.EJOR.2023.05.014MaRDI QIDQ6096568zbMATH OpenFDO

Authors Sandy Spiers, Hoa T. Bui, Ryan Loxton

Publication date 15 September 2023

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

branch and cutcombinatorial optimizationcutting planesEuclidean distancemaximum diversity

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A branch and bound algorithm for the maximum diversity problem
• A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
• A review on discrete diversity and dispersion maximization from an OR perspective
• An exact semidefinite programming approach for the max-mean dispersion problem
• An integer programming approach for solving the p-dispersion problem
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Heuristic and Special Case Algorithms for Dispersion Problems
• scientific article; zbMATH DE number 3774424 (Why is no real title available?)
• scientific article; zbMATH DE number 3335677 (Why is no real title available?)
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Maximum diversity problem with squared Euclidean distance
• Measuring diversity. A review and an empirical analysis
• Methods for constructing distance matrices and the inverse eigenvalue problem
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• The discrete p-dispersion problem
• Une méthode d'optimisation non linéaire en variables mixtes pour la conception de procédés
• Upper bounds and exact algorithms for \(p\)-dispersion problems
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem

Cited in

(5)

• On cutting plane algorithms for nonlinear binary optimization
• Solving Euclidean max-sum problems exactly with cutting planes
• A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem
• Fast exact algorithms for the maximum diversity problem
• An exact method for the bi-objective p-median max-sum diversity problem

This page was built for publication: An exact cutting plane method for the Euclidean max-sum diversity problem

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