On the complexity of the exchange algorithm for minimax optimization problems (Q3770292): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On minimax optimization problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Single Facility $l_p $-Distance Minimax Location / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient Algorithms for the (Weighted) Minimum Circle Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5630824 / rank | |||
Normal rank |
Revision as of 12:40, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of the exchange algorithm for minimax optimization problems |
scientific article |
Statements
On the complexity of the exchange algorithm for minimax optimization problems (English)
0 references
1987
0 references
location
0 references
minimax optimization
0 references
convex functions
0 references