A D.C. algorithm via convex analysis approach for solving a location problem involving sets (Q2814272)
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: A D.C. algorithm via convex analysis approach for solving a location problem involving sets |
scientific article; zbMATH DE number 6595718
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A D.C. algorithm via convex analysis approach for solving a location problem involving sets |
scientific article; zbMATH DE number 6595718 |
Statements
21 June 2016
0 references
d.c. programming
0 references
nonconvex location problem
0 references
Pham Dinh-Le Thi algorithm
0 references
Weiszfeld algorithm
0 references
math.OC
0 references
A D.C. algorithm via convex analysis approach for solving a location problem involving sets (English)
0 references
