Cutting Plane Algorithms are Exact for Euclidean Max-Sum Problems (Q6451468)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Cutting Plane Algorithms are Exact for Euclidean Max-Sum Problems |
scientific article; zbMATH DE number 902328174
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cutting Plane Algorithms are Exact for Euclidean Max-Sum Problems |
scientific article; zbMATH DE number 902328174 |
Statements
17 September 2023
0 references
math.OC
0 references
