The Mixed Center Location Problem
From MaRDI portal
Recommendations
- The mixed center location problem
- scientific article; zbMATH DE number 1417719
- The p-center location problem in an area
- scientific article; zbMATH DE number 849074
- A center location problem with congestion
- The \(k\)-centrum multi-facility location problem
- The General One Center Location Problem
- The multiple server center location problem
- One-way and round-trip center location problems
Cites work
- scientific article; zbMATH DE number 6472586 (Why is no real title available?)
- 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
- Clustering to minimize the maximum intercluster distance
- Finding tailored partitions
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- More planar two-center algorithms
- On the Complexity of Some Common Geometric Location Problems
- The Euclidean \(k\)-supplier problem
- The discrete 2-center problem
- The slab dividing approach to solve the Euclidean \(P\)-center problem
- Voronoi diagrams and Delaunay triangulations
Cited in
(6)- scientific article; zbMATH DE number 5691661 (Why is no real title available?)
- The mixed center location problem
- A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems
- The discrete and mixed minimax 2-center problem
- scientific article; zbMATH DE number 1417719 (Why is no real title available?)
- The discrete and mixed minimax 2-center problems
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 Q2958327)