A comparison of p-dispersion heuristics
- 31 December 1994
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 21 (10) , 1103-1113
- https://doi.org/10.1016/0305-0548(94)90041-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Facility dispersion problems: Heuristics and special casesPublished by Springer Nature ,2005
- Heuristic and Special Case Algorithms for Dispersion ProblemsOperations Research, 1994
- Good solutions to discrete noxious location problems via metaheuristicsAnnals of Operations Research, 1992
- The maximal dispersion problem and the “First point outside the neighbourhood” heuristicComputers & Operations Research, 1991
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number PartitioningOperations Research, 1991
- The discrete p-dispersion problemEuropean Journal of Operational Research, 1990
- Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean SpaceManagement Science, 1988
- Programming Models for Facility Dispersion: The p‐Dispersion and Maxisum Dispersion ProblemsGeographical Analysis, 1987
- Heuristic “Optimization”: Why, When, and How to Use ItInterfaces, 1981
- Intra-set point generation and filtering in decision and criterion spaceComputers & Operations Research, 1980