The mixed center location problem
type: Item
instance of: scholarly article
title: The mixed center location problem
zbMATH Open document ID: 1414.90197
author: Yi Xu
author: Ji-Gen Peng
author: Yinfeng Xu
published in: Journal of Combinatorial Optimization
publication date: 2018-12-06T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6990046
zbMATH Keywords: \(k\)-center problem
zbMATH Keywords: facility location problem
zbMATH Keywords: Voronoi diagram
zbMATH Keywords: computational geometry
MaRDI profile type: Publication
full work available at URL: s10878-017-0183-4
OpenAlex ID: W2763841626
cites work: The discrete 2-center problem
cites work: Voronoi diagrams and Delaunay triangulations
cites work: More planar two-center algorithms
cites work: New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
cites work: The p-Centre Problem-Heuristic and Optimal Algorithms
cites work: A new formulation and resolution method for the \(p\)-center problem
cites work: Q5501789
cites work: Clustering to minimize the maximum intercluster distance
cites work: A faster algorithm for the two-center decision problem
cites work: Finding tailored partitions
cites work: A Best Possible Heuristic for the k-Center Problem
cites work: The slab dividing approach to solve the Euclidean \(P\)-center problem
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: On the Complexity of Some Common Geometric Location Problems
cites work: The Euclidean k-Supplier Problem
cites work: Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
cites work: A near-linear algorithm for the planar 2-center problem
DOI: 10.1007/S10878-017-0183-4
description: scientific article; zbMATH DE number 6990046