A note on the m-center problem with rectilinear distances
From MaRDI portal
Publication:913636
DOI10.1016/0377-2217(88)90384-0zbMath0699.90028MaRDI QIDQ913636
K. P. K. Nair, R. Chandrasekaran, 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
intersection graph; facility location; covering nodes by cliques; m-center problem; rectilinear distances
90C35: Programming involving graphs or networks
90C10: Integer programming
90B05: Inventory, storage, reservoirs
Related Items
Use of reference points for solving MONLP problems, A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem, The 1-center problem in the plane with independent random weights
Cites Work