Technical Note—Minisum <i>I</i><sub><i>p</i></sub> Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm (Q3885476)
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 3691027
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Technical Note—Minisum <i>I</i><sub><i>p</i></sub> Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm |
scientific article; zbMATH DE number 3691027 |
Statements
Technical Note—Minisum <i>I</i><sub><i>p</i></sub> Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm (English)
0 references
1979
0 references
uniform convergence
0 references
logistics
0 references
minisum lp distance location problems
0 references
perturbed problem
0 references
Weiszfeld's algorithm
0 references
facility location
0 references
differentiable approximation function
0 references
nondifferentiable convex objective function
0 references
convergence properties
0 references
computational experience
0 references
multifacility location problems
0 references
