Abstract
LetV = {v 1,⋯, v n } be a set ofn points on the real line (existing facilities). The problem considered is to locatep new point facilities,F 1,⋯, F p , inV while satisfying distance constraints between pairs of existing and new facilities and between pairs of new facilities. Fori = 1, ⋯, p, j = 1, ⋯, n, the cost of locatingF i at pointv j isc ij . The objective is to minimize the total cost of setting up the new facilities. We present anO(p 3 n 2 logn) algorithm to solve the model.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
