An exact cutting plane method for the Euclidean max-sum diversity problem
From MaRDI portal
Publication:6096568
DOI10.1016/j.ejor.2023.05.014MaRDI QIDQ6096568
R. C. Loxton, Hoa T. Bui, Sandy Spiers
Publication date: 15 September 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- An integer programming approach for solving the \(p\)-dispersion problem
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- The discrete p-dispersion problem
- Methods for constructing distance matrices and the inverse eigenvalue problem
- Measuring diversity. A review and an empirical analysis
- Maximum diversity problem with squared Euclidean distance
- A branch and bound algorithm for the maximum diversity problem
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- An exact semidefinite programming approach for the max-mean dispersion problem
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- A review on discrete diversity and dispersion maximization from an OR perspective
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Une méthode d'optimisation non linéaire en variables mixtes pour la conception de procédés
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Heuristic and Special Case Algorithms for Dispersion Problems
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
This page was built for publication: An exact cutting plane method for the Euclidean max-sum diversity problem
