Solving Euclidean max-sum problems exactly with cutting planes (Q6979468)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8045237
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving Euclidean max-sum problems exactly with cutting planes |
scientific article; zbMATH DE number 8045237 |
Statements
Solving Euclidean max-sum problems exactly with cutting planes (English)
0 references
26 May 2025
0 references
Euclidean distance matrix
0 references
cutting plane methods
0 references
constrained diversity sum
0 references
exact algorithms
0 references
nonlinear binary optimisation
0 references
0 references
0 references
0 references
0 references
0 references
