Solving general continuous single facility location problems by cutting planes (Q1086129)
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: Publication:1086129 |
scientific article; zbMATH DE number 3984925
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving general continuous single facility location problems by cutting planes |
scientific article; zbMATH DE number 3984925 |
Statements
Solving general continuous single facility location problems by cutting planes (English)
0 references
1987
0 references
A unified cutting plane method is proposed to solve a large class of continuous single facility location problems. These include both minisum and minimax problems with mixed norms and convex transportation costs. The method provides an easy stopping rule and permits the post optimal determination of an outer approximation to near optimality regions. Two examples are given which show the power of the method. Extensive computational results in dimension two and higher are reported.
0 references
unified cutting plane method
0 references
continuous single facility location
0 references
minisum
0 references
minimax
0 references
mixed norms
0 references
convex transportation costs
0 references
outer approximation
0 references
near optimality regions
0 references
computational results
0 references
0 references
0.8097030520439148
0 references
0.7992628216743469
0 references
0.7983400821685791
0 references
0.7846353650093079
0 references
0.7832196950912476
0 references
