An exact cutting plane method for the Euclidean max-sum diversity problem
This paper aims to answer an open question recently posed in the literature, that is to find a fast exact method for solving the max-sum diversity problem, a nonconcave quadratic binary maximization problem. We show that, for Euclidean max-sum diversity problems (EMSDP), the distance matrix defining...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
2023
|
| Online Access: | http://purl.org/au-research/grants/arc/IC180100030 http://hdl.handle.net/20.500.11937/96042 |