On weighted rectilinear 2-center and 3-center problems

DOI10.1016/0020-0255(91)90050-5zbMath0722.90039OpenAlexW2012063619MaRDI QIDQ757236

Richard Chia-Tung Lee, Ming-Tat Ko

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

zbMATH Keywords

weighted rectilinear m-center optimization

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Continuous location (90B85) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance ⋮ A simple linear algorithm for computing rectilinear 3-centers

Cites Work

• Unnamed Item
• Layout of facilities with some fixed points
• Rectilinear m -Center problem
• The p-Centre Problem-Heuristic and Optimal Algorithms
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Single Facility $l_p $-Distance Minimax Location
• On the rectangularp-center problem

This page was built for publication: On weighted rectilinear 2-center and 3-center problems