Algorithms for location problems based on angular distances
type: Item
instance of: scholarly article
title: Algorithms for location problems based on angular distances
zbMATH Open document ID: 1302.90107
DOI: 10.1155/2014/701267
author: Lev A. Kazakovtsev
author: Mikhail N. Gudyma
author: Alexander N. Antamoshkin
author: Predrag S. Stanimirović
author: Idowu Ademola Osinuga
published in: Advances in Operations Research
publication date: 2014-11-17T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90B85
zbMATH DE Number: 6370024
Wikidata QID: Q59047891
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/701267
OpenAlex ID: W2136904079
cites work: Q4229604
cites work: Location science research: a review
cites work: A SINGLE FACILITY MINISUM LOCATION PROBLEM UNDER THE A-DISTANCE
cites work: The existence and uniqueness of the minimum norm solution to certain linear and nonlinear problems
cites work: Q2929873
cites work: Mathematical Models of Road Travel Distances
cites work: The Plant Location Problem: New Models and Research Prospects
cites work: Q3539497
cites work: The impact of distance on location problems
cites work: Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
cites work: Weber problems with mixed distances and regional demand
cites work: Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms
cites work: A unified model for Weber problems with continuous and network distances
cites work: Inverse \(p\)-median problems with variable edge lengths
cites work: Discrete location problem on arbitrary surface in \(\mathbb R^3\)
cites work: The minisum location problem for the Jaccard metric
cites work: Q5417625
cites work: An Algorithm for the Single Facility Location Problem Using the Jaccard Metric
cites work: Q5403504
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Encyclopedia of Distances
cites work: A computation procedure for the exact solution of location-allocation problems with rectangular distances
cites work: Effective algorithm for the weber problem with a rectangular metric
cites work: Noniterative solution of some Fermat-Weber location problems
Recommended article: A fast algorithm for the rectilinear distance location problem
Recommended article: Algorithms for location referencing
Recommended article: A discretizing algorithm for location problems
Recommended article: An efficient algorithm for the Euclidean \(r\)-centrum location problem
Recommended article: Q3325463
Recommended article: Approximation of solutions for location problems
Recommended article: Q5715833
Recommended article: Models, algorithms and applications for location problems
Recommended article: An algorithm for generalized point location and its applications
Recommended article: Some new algorithms for location problems on networks
description: scientific article; zbMATH DE number 6370024