Solving Euclidean Max-Sum problems exactly with cutting planes
This paper studies binary quadratic programs in which the objective is defined by the maximisation of a Euclidean distance matrix, subject to a general polyhedral constraint set. This class of nonconcave maximisation problems, which we refer to as the Euclidean Max-Sum problem, includes the capacita...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
2024
|
| Online Access: | http://purl.org/au-research/grants/arc/IC180100030 http://hdl.handle.net/20.500.11937/96034 |