A note on the m-center problem with rectilinear distances
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3427118 (Why is no real title available?)
- scientific article; zbMATH DE number 3752234 (Why is no real title available?)
- scientific article; zbMATH DE number 3296906 (Why is no real title available?)
- scientific article; zbMATH DE number 3307331 (Why is no real title available?)
- An Algorithm for the p-Center Problem in the Plane
- Location problems
- The m-Center Problem
- The m-Center Problem: Minimax Facility Location
- The p-Centre Problem-Heuristic and Optimal Algorithms
Cited in
(13)- The 1-center problem in the plane with independent random weights
- On the rectangularp-center problem
- Bounded fan-out \(m\)-center problem
- The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints
- Use of reference points for solving MONLP problems
- A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem
- An optimal approximation algorithm for the rectilinear m-center problem
- Optimal multifacility defensive location on planes with rectilinear distances
- An Algorithm for the p-Center Problem in the Plane
- A correction to the definition of local center
- Planar maximal covering location problem under block norm distance measure
- The continuousm-center problem on a network
- One-facility location with rectilinear tour distances
This page was built for publication: A note on the m-center problem with rectilinear distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q913636)