Algorithms for location problems based on angular distances

DOI10.1155/2014/701267zbMath1302.90107OpenAlexW2136904079WikidataQ59047891 ScholiaQ59047891MaRDI QIDQ471721

Mikhail N. Gudyma, Alexander N. Antamoshkin, Lev A. Kazakovtsev, Predrag S. Stanimirović, Idowu Ademola Osinuga

Publication date: 17 November 2014

Published in: Advances in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/701267

Mathematics Subject Classification ID

Continuous location (90B85)

Cites Work

• Inverse \(p\)-median problems with variable edge lengths
• Noniterative solution of some Fermat-Weber location problems
• Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms
• The impact of distance on location problems
• The minisum location problem for the Jaccard metric
• The existence and uniqueness of the minimum norm solution to certain linear and nonlinear problems
• Location science research: a review
• A unified model for Weber problems with continuous and network distances
• Weber problems with mixed distances and regional demand
• An Algorithm for the Single Facility Location Problem Using the Jaccard Metric
• Mathematical Models of Road Travel Distances
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Effective algorithm for the weber problem with a rectangular metric
• Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
• A computation procedure for the exact solution of location-allocation problems with rectangular distances
• The Plant Location Problem: New Models and Research Prospects
• A SINGLE FACILITY MINISUM LOCATION PROBLEM UNDER THE A-DISTANCE
• Encyclopedia of Distances
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for location problems based on angular distances