A comparison of \(p\)-dispersion heuristics
From MaRDI portal
Publication:1342949
DOI10.1016/0305-0548(94)90041-8zbMath0814.90059OpenAlexW2056749377MaRDI QIDQ1342949
Yilmaz Ülküsal, Oktay Yeniçerioǧlu, Erhan Erkut
Publication date: 9 February 1995
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90041-8
Related Items (10)
Generalized route planning model for hazardous material transportation with VaR and equity considerations ⋮ Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach ⋮ A branch and bound approach for the tower crane selection and positioning problem with respect to mutual interference ⋮ On finding dissimilar paths ⋮ Mixed-integer programming models for tower crane selection and positioning with respect to mutual interference ⋮ An iterated greedy heuristic for a market segmentation problem with multiple attributes ⋮ Computational geometric aspects of rhythm, melody, and voice-leading ⋮ Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs ⋮ Repulsion-based p-dispersion with distance constraints in non-convex polygons ⋮ Approximate solutions of continuous dispersion problems
Cites Work
- Good solutions to discrete noxious location problems via metaheuristics
- The discrete p-dispersion problem
- A study on two geometric location problems
- The maximal dispersion problem and the ``first point outside the neighbourhood heuristic
- Comparison Of Four Models For dispersing Facilities
- Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Heuristic and Special Case Algorithms for Dispersion Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A comparison of \(p\)-dispersion heuristics
