A comparison of \(p\)-dispersion heuristics
type: Item
instance of: scholarly article
title: A comparison of \(p\)-dispersion heuristics
zbMATH Open document ID: 0814.90059
DOI: 10.1016/0305-0548(94)90041-8
author: Erhan Erkut
author: Yilmaz Ülküsal
author: Oktay Yeniçerioǧlu
published in: Computers \& Operations Research
publication date: 1995-02-09T00:00:00Z
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 711792
zbMATH Keywords: \(p\)-dispersion
zbMATH Keywords: location theory
zbMATH Keywords: multicriteria optimization
zbMATH Keywords: heuristic methods
MaRDI profile type: Publication
full work available at URL: 0305-0548(94)90041-8
OpenAlex ID: W2056749377
cites work: The discrete p-dispersion problem
cites work: Q3815146
cites work: A study on two geometric location problems
cites work: Comparison Of Four Models For dispersing Facilities
cites work: The maximal dispersion problem and the ``first point outside the neighbourhood'' heuristic
cites work: Q3991284
cites work: Q4037432
cites work: Heuristic and Special Case Algorithms for Dispersion Problems
cites work: Good solutions to discrete noxious location problems via metaheuristics
cites work: Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
cites work: Q4040221
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
description: scientific article; zbMATH DE number 711792