An exact cutting plane method for the Euclidean max-sum diversity problem
From MaRDI portal
Publication:6096568
DOI10.1016/J.EJOR.2023.05.014MaRDI QIDQ6096568FDOQ6096568
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)
Cites Work
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Title not available (Why is that?)
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- The discrete p-dispersion problem
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- An integer programming approach for solving the \(p\)-dispersion problem
- Heuristic and Special Case Algorithms for Dispersion Problems
- Title not available (Why is that?)
- A branch and bound algorithm for the maximum diversity problem
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Methods for constructing distance matrices and the inverse eigenvalue 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
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
- Une méthode d'optimisation non linéaire en variables mixtes pour la conception de procédés
- Measuring diversity. A review and an empirical analysis
- Maximum diversity problem with squared Euclidean distance
- A review on discrete diversity and dispersion maximization from an OR perspective
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)
