The mixed center location problem

DOI10.1007/S10878-017-0183-4MaRDI QIDQ1631666zbMATH OpenOpenAlexFDO

Authors Yi Xu, Ji-Gen Peng, Yinfeng 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

\(k\)-center problemcomputational geometryfacility location problemVoronoi diagram

Mathematics Subject Classification ID

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

Recommendations

• The Mixed Center Location Problem
• The discrete and mixed minimax 2-center problem
• The discrete and mixed minimax 2-center problems
• On the rectangularp-center problem
• An approximation algorithm for k-center problem on a convex polygon

Cites work

• A Best Possible Heuristic for the k-Center Problem
• A faster algorithm for the two-center decision problem
• A near-linear algorithm for the planar 2-center problem
• A new formulation and resolution method for the p-center problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Clustering to minimize the maximum intercluster distance
• Finding tailored partitions
• scientific article; zbMATH DE number 6472586 (Why is no real title available?)
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• More planar two-center algorithms
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
• On the Complexity of Some Common Geometric Location Problems
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• The discrete 2-center problem
• The Euclidean \(k\)-supplier problem
• The p-Centre Problem-Heuristic and Optimal Algorithms
• The slab dividing approach to solve the Euclidean \(P\)-center problem
• Voronoi diagrams and Delaunay triangulations

Cited in

(9)

• A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems
• The discrete and mixed minimax 2-center problems
• The Euclidean \(k\)-supplier problem in \(I R^2\)
• The Mixed Center Location Problem
• The discrete and mixed minimax 2-center problem
• scientific article; zbMATH DE number 1417719 (Why is no real title available?)
• scientific article; zbMATH DE number 5691661 (Why is no real title available?)
• Discrete and mixed two-center problems for line segments
• The 2-mixed-center color spanning problem

This page was built for publication: The mixed center location problem

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