On weighted rectilinear 2-center and 3-center problems
From MaRDI portal
DOI10.1016/0020-0255(91)90050-5zbMATH Open0722.90039OpenAlexW2012063619MaRDI QIDQ757236FDOQ757236
Publication date: 1991
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(91)90050-5
Recommendations
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Continuous location (90B85)
Cites Work
- Title not available (Why is that?)
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- On the rectangularp-center problem
- Single Facility $l_p $-Distance Minimax Location
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- The p-Centre Problem-Heuristic and Optimal Algorithms
- Layout of facilities with some fixed points
- Rectilinear m -Center problem
Cited In (10)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
