The mixed center location problem

DOI10.1007/s10878-017-0183-4zbMath1414.90197OpenAlexW2763841626MaRDI QIDQ1631666

Yi Xu, Ji-Gen Peng, Yin-Feng Xu

Publication date: 6 December 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0183-4

zbMATH Keywords

Voronoi diagramcomputational geometryfacility location problem\(k\)-center problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

The Euclidean \(k\)-supplier problem in \(I R^2\), Discrete and mixed two-center problems for line segments

Cites Work

• Unnamed Item
• A faster algorithm for the two-center decision problem
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
• Clustering to minimize the maximum intercluster distance
• The slab dividing approach to solve the Euclidean \(P\)-center problem
• The discrete 2-center problem
• A near-linear algorithm for the planar 2-center problem
• More planar two-center algorithms
• Voronoi Diagrams and Delaunay Triangulations
• A New Formulation and Resolution Method for the p-Center Problem
• On the Complexity of Some Common Geometric Location Problems
• The p-Centre Problem-Heuristic and Optimal Algorithms
• Finding tailored partitions
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• A Best Possible Heuristic for the k-Center Problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• The Euclidean k-Supplier Problem