Coordinate partitioning for difficult Euclidean max-sum diversity problems (Q6856983)
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 8160797
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coordinate partitioning for difficult Euclidean max-sum diversity problems |
scientific article; zbMATH DE number 8160797 |
Statements
Coordinate partitioning for difficult Euclidean max-sum diversity problems (English)
0 references
18 February 2026
0 references
diversity problem
0 references
functional decomposition
0 references
cutting-plane methods
0 references
nonconvex quadratic programming
0 references
