A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem

DOI10.1016/S0377-2217(97)00191-4zbMath0955.90069MaRDI QIDQ1291662

Blas Pelegrín, Lázaro Cánovas

Publication date: 22 February 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicscluster analysislocation

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• A simple heuristic for the p-centre problem
• A note on the m-center problem with rectilinear distances
• On the uniqueness of optimal solutions in continuous location theory
• A heuristic for the p-center problem in graphs
• Rectilinear m -Center problem
• On the Complexity of Some Common Geometric Location Problems
• The p-Centre Problem-Heuristic and Optimal Algorithms
• Heuristic methods for thep-center problem
• A Best Possible Heuristic for the k-Center Problem
• An Algorithm for the p-Center Problem in the Plane
• A Note on p-Center Problems in the Plane
• On the rectangularp-center problem
• New heuristic algorithms for the rectangular $p$-cover problem
• The Minimum Covering Sphere Problem

This page was built for publication: A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem