A comparison of p-dispersion heuristics

DOI10.1016/0305-0548(94)90041-8MaRDI QIDQ1342949zbMATH OpenOpenAlexFDO

Authors Erhan Erkut, Yilmaz Ülküsal, Oktay Yeniçerioǧlu

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

zbMATH Keywords

\(p\)-dispersionheuristic methodslocation theorymulticriteria optimization

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• The discrete p-dispersion problem
• scientific article; zbMATH DE number 36716
• Heuristic and Special Case Algorithms for Dispersion Problems
• An integer programming approach for solving the p-dispersion problem
• The maximal dispersion problem and the ``first point outside the neighbourhood heuristic

Cites work

• A study on two geometric location problems
• Comparison Of Four Models For dispersing Facilities
• Good solutions to discrete noxious location problems via metaheuristics
• Heuristic and Special Case Algorithms for Dispersion Problems
• Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 36716 (Why is no real title available?)
• scientific article; zbMATH DE number 177561 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• The discrete p-dispersion problem
• The maximal dispersion problem and the ``first point outside the neighbourhood heuristic

Cited in

(16)

• Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
• An iterated greedy heuristic for a market segmentation problem with multiple attributes
• Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs
• On finding dissimilar paths
• Mixed-integer programming models for tower crane selection and positioning with respect to mutual interference
• Repulsion-based p-dispersion with distance constraints in non-convex polygons
• A branch and bound approach for the tower crane selection and positioning problem with respect to mutual interference
• Generalized route planning model for hazardous material transportation with VaR and equity considerations
• Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
• scientific article; zbMATH DE number 36716 (Why is no real title available?)
• Polynomial algorithms for p-dispersion problems in a planar Pareto Front
• The repeated p-dispersion problem
• An efficient probability-based VNS algorithm for delivery territory design
• Computational geometric aspects of rhythm, melody, and voice-leading
• Approximate solutions of continuous dispersion problems
• The discrete p-dispersion problem

This page was built for publication: A comparison of \(p\)-dispersion heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342949)