Coordinate partitioning for difficult Euclidean max-sum diversity problems

DOI10.1287/OPRE.2023.0612MaRDI QIDQ6856983zbMATH OpenFDO

Authors Sandy Spiers, Hoa Thi Bui, Ryan Loxton

Publication date 18 February 2026

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/OPRE.2023.0612

zbMATH Keywords

nonconvex quadratic programmingcutting-plane methodsdiversity problemfunctional decomposition

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

This page was built for publication: Coordinate partitioning for difficult Euclidean max-sum diversity problems

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