The maximal dispersion problem and the ``first point outside the neighbourhood heuristic

DOI10.1016/0305-0548(91)90040-XzbMath0717.90040OpenAlexW2089568296MaRDI QIDQ2638928

Douglas J. White

Publication date: 1991

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(91)90040-x

zbMATH Keywords

heuristicmaximally dispersed points

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (9)

Unified interactive multiple objective programming ⋮ A comparison of \(p\)-dispersion heuristics ⋮ Facility dispersion and remote subgraphs ⋮ Solving the anti-covering location problem using Lagrangian relaxation ⋮ A linear time approximation scheme for computing geometric maximum \(k\)-star ⋮ Discrete representation of non-dominated sets in multi-objective linear programming ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Computational geometric aspects of rhythm, melody, and voice-leading ⋮ Integer-friendly formulations for the \(r\)-separation problem

Cites Work

• Unnamed Item
• Unnamed Item
• A simple heuristic for the p-centre problem
• The simple plant location problem: Survey and synthesis
• An Interactive Multiple-Objective Linear Programming Approach to a Problem in Forest Management
• Heuristic-Programming Solution of a Flowshop-Scheduling Problem

This page was built for publication: The maximal dispersion problem and the ``first point outside the neighbourhood heuristic