Solving Euclidean max-sum problems exactly with cutting planes

DOI10.1016/J.COR.2024.106682MaRDI QIDQ6979468zbMATH OpenFDO

Authors Hoa Thi Bui, Sandy Spiers, Ryan Loxton

Publication date 26 May 2025

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106682

zbMATH Keywords

constrained diversity sumcutting plane methodsEuclidean distance matrixexact algorithmsnonlinear binary optimisation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• \(\alpha BB\): A global optimization method for general constrained nonconvex problems
• 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 lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
• A review on discrete diversity and dispersion maximization from an OR perspective
• An exact cutting plane method for the Euclidean max-sum diversity problem
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Analytical models for locating undesirable facilities
• Heuristics for the capacitated dispersion problem
• scientific article; zbMATH DE number 1033392 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• JuMP 1.0: recent improvements to a modeling language for mathematical optimization
• Least squares quantization in PCM
• Measuring diversity. A review and an empirical analysis
• On branching rules for convex mixed-integer nonlinear optimization
• On certain metric spaces arising from euclidean spaces by a change of metric and their imbedding in Hilbert space
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
• Polyhedral approximation in mixed-integer convex optimization
• Remarks to Maurice Fréchet's article ``Sur la définition axiomatique d'une classe d'espaces vectoriels distanciés applicables vectoriellement sur l'espace de Hilbert.
• The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
• The supporting hyperplane optimization toolkit for convex MINLP
• Using regularization and second order information in outer approximation for convex MINLP

Cited in

(2)

• On cutting plane algorithms for nonlinear binary optimization
• An exact method for the bi-objective p-median max-sum diversity problem

This page was built for publication: Solving Euclidean max-sum problems exactly with cutting planes

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