The maximal dispersion problem and the “First point outside the neighbourhood” heuristic

In this paper, we consider the problem of selecting, from a finite set S ⊂- R n , endowed with a metric ∥ ∥, p maximally dispersed points. An heuristic, called the “first point outside the neighbourhood” heuristic, is studied. The main results are that the dispersion, produced by the heuristic, is n...

Full description

Saved in:
Bibliographic Details
Published inComputers & operations research Vol. 18; no. 1; pp. 43 - 50
Main Author White, Douglas J.
Format Journal Article
LanguageEnglish
Published Oxford Elsevier Ltd 1991
Elsevier Science
Pergamon Press Inc
Subjects
Applied sciences
Exact sciences and technology
Heuristic
Mathematical models
Operational research and scientific management
Operational research. Management science
Operations research
Optimization. Search problems
Theory
Worse case method
Linear programming
Dispersion
Optimization
Heuristic method
Online AccessGet full text

Cover

More Information
Summary:In this paper, we consider the problem of selecting, from a finite set S ⊂- R n , endowed with a metric ∥ ∥, p maximally dispersed points. An heuristic, called the “first point outside the neighbourhood” heuristic, is studied. The main results are that the dispersion, produced by the heuristic, is never worse than 1 3 of the maximal dispersion and that, for certain values of p, the dispersion obtained is not worse than 1 2 of the maximal dispersion.
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/0305-0548(91)90040-X