A note on the m-center problem with rectilinear distances

DOI10.1016/0377-2217(88)90384-0zbMath0699.90028OpenAlexW1994367550MaRDI QIDQ913636

R. Chandrasekaran, K. P. K. Nair, Yash P. Aneja

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

zbMATH Keywords

intersection graphfacility locationcovering nodes by cliquesm-center problemrectilinear distances

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Inventory, storage, reservoirs (90B05)

Related Items

Use of reference points for solving MONLP problems, The 1-center problem in the plane with independent random weights, A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem

Cites Work

• Location problems
• The p-Centre Problem-Heuristic and Optimal Algorithms
• An Algorithm for the p-Center Problem in the Plane
• The m-Center Problem: Minimax Facility Location
• The m-Center Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item