Algorithms for location problems based on angular distances (Q471721)
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: Algorithms for location problems based on angular distances |
scientific article; zbMATH DE number 6370024
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for location problems based on angular distances |
scientific article; zbMATH DE number 6370024 |
Statements
Algorithms for location problems based on angular distances (English)
0 references
17 November 2014
0 references
Summary: This paper describes four mathematical models for the single-facility location problems based on four special distance metrics and algorithms for solving such problems. In this study, algorithms of solving Weber problems using four distance predicting functions (DPFs) are proposed in accordance with four strategies for manipulator control. A numerical example is presented in this proposal as an analytical proof of the optimality of their results.
0 references
0 references
0 references
0 references
0.86558527
0 references
0 references
0.86232024
0 references
0.8504043
0 references
0.8442453
0 references
0.84377664
0 references
0.84340227
0 references
0.84239423
0 references
