Heuristics for the facility location and design (1|1)-centroid problem on the plane

Authors:
J. L. Redondo;J. Fernández;I. García;P. M. Ortigosa
Affiliations:
Department of Computer Architecture and Electronics, University of Almería, Almería, Spain;Facultad de Matemáticas, Universidad de Murcia, Murcia, Spain 30100 and Department of Statistics and Operations Research, University of Murcia, Murcia, Spain;Department of Computer Architecture and Electronics, University of Almería, Almería, Spain;Department of Computer Architecture and Electronics, University of Almería, Almería, Spain
Venue:
Computational Optimization and Applications
Year:
2010

Citing 4
Cited 6

Economics of location:: a selective survey

Computers and Operations Research - location science
Reliability and Performance of UEGO, a Clustering-based Global Optimizer

Journal of Global Optimization
An alternating heuristic for medianoid and centroid problems in the plane

Computers and Operations Research
Optimal location and design of a competitive facility

Mathematical Programming: Series A and B

Parallel algorithms for continuous competitive location problems

Optimization Methods & Software - THE JOINT EUROPT-OMS CONFERENCE ON OPTIMIZATION, 4-7 JULY, 2007, PRAGUE, CZECH REPUBLIC, PART I
Universal Global Optimization Algorithm on Shared Memory Multiprocessors

IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Parallel algorithms for continuous multifacility competitive location problems

Journal of Global Optimization
Parallel evolutionary algorithms based on shared memory programming approaches

The Journal of Supercomputing
Particle swarm optimization with two swarms for the discrete (r|p)-centroid problem

EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Solution of multi-objective competitive facility location problems using parallel NSGA-II on large scale computing systems

PARA'12 Proceedings of the 11th international conference on Applied Parallel and Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose and analyze an inexact version of the modified subgradient (MSG) algorithm, which we call the IMSG algorithm, for nonsmooth and nonconvex optimization over a compact set. We prove that under an approximate, i.e. inexact, minimization of the ...