A robust and efficient algorithm for planar competitive location problems
type: Item
instance of: scholarly article
title: A robust and efficient algorithm for planar competitive location problems
zbMATH Open document ID: 1163.90011
published in: Annals of Operations Research
publication date: 2009-06-25T00:00:00Z
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5570717
zbMATH Keywords: continuous location
zbMATH Keywords: competition
zbMATH Keywords: Weiszfeld-like algorithm
zbMATH Keywords: heuristic
zbMATH Keywords: evolutionary algorithm
zbMATH Keywords: computational study
author: Juana L. Redondo
author: José Fernández
author: I. García
author: Pilar M. Ortigosa
describes a project that uses: PROFIL/BIAS
describes a project that uses: Tabu search
describes a project that uses: C-XSC
describes a project that uses: UEGO
MaRDI profile type: Publication
full work available at URL: s10479-007-0233-x
OpenAlex ID: W2047512859
cites work: Q4229634
cites work: The p-Centre Problem-Heuristic and Optimal Algorithms
cites work: Finding the optimal solution to the Huff based competitive location model
cites work: The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
cites work: Solving the multiple competitive facilities location problem
cites work: Analytical models for locating undesirable facilities
cites work: Using interval analysis for solving planar single-facility location problems: New discarding tests
cites work: A continuous location model for siting a non-noxious undesirable facility within a geographical region
cites work: Estimating actual distances by norm functions: A comparison between the \(l_{k,p,\theta}\)-norm and the \(l_{b_1,b_2,\theta}\)-norm and a study about the selection of the data set
cites work: Solving a huff-like competitive location and design model for profit maximization in the plane
cites work: Q4354785
cites work: Q4692508
cites work: Q3971522
cites work: Q4835644
cites work: Variable neighborhood search: Principles and applications
cites work: The Minisum and Minimax Location Problems Revisited
cites work: On the use of genetic algorithms to solve location problems
cites work: Optimization by Simulated Annealing
cites work: PROFIL/BIAS - A fast interval library
cites work: Reliability and performance of UEGO, a clustering-based global optimizer
cites work: GBSSS: The generalized big square small square method for planar single- facility location
cites work: Minimization by Random Search Techniques
cites work: A d.c. optimization method for single facility location problems
DOI: 10.1007/S10479-007-0233-X
description: scientific article; zbMATH DE number 5570717