On weighted rectilinear 2-center and 3-center problems
From MaRDI portal
(Redirected from Publication:757236)
Recommendations
Cites work
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Layout of facilities with some fixed points
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- On the rectangularp-center problem
- Rectilinear m -Center problem
- Single Facility $l_p $-Distance Minimax Location
- The p-Centre Problem-Heuristic and Optimal Algorithms
Cited in
(12)- Geometric \(p\)-center problems with centers constrained to two lines
- scientific article; zbMATH DE number 34574 (Why is no real title available?)
- A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
- Solving LP Problems via Weighted Centers
- An optimal approximation algorithm for the rectilinear m-center problem
- Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p
- A simple linear algorithm for computing rectilinear 3-centers
- A note on the m-center problem with rectilinear distances
- scientific article; zbMATH DE number 1728311 (Why is no real title available?)
- scientific article; zbMATH DE number 1588326 (Why is no real title available?)
- On weighted centers for semidefinite programming
- Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance
This page was built for publication: On weighted rectilinear 2-center and 3-center problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757236)