A note on the m-center problem with rectilinear distances
From MaRDI portal
DOI10.1016/0377-2217(88)90384-0zbMATH Open0699.90028OpenAlexW1994367550MaRDI QIDQ913636FDOQ913636
Y. P. Aneja, R. Chandrasekaran, K. P. K. Nair
Publication date: 1988
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(88)90384-0
Programming involving graphs or networks (90C35) Integer programming (90C10) Inventory, storage, reservoirs (90B05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The m-Center Problem: Minimax Facility Location
- The m-Center Problem
- The p-Centre Problem-Heuristic and Optimal Algorithms
- Title not available (Why is that?)
- An Algorithm for the p-Center Problem in the Plane
- Location problems
Cited In (9)
- The 1-center problem in the plane with independent random weights
- 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
- 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
- The continuousm-center problem on a network
- One-facility location with rectilinear tour distances
Recommendations
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)
