Abstract
In this paper we investigate the conditional p-median problem. Optimal algorithms for the Euclidean case in the plane for the 1-median with several existing facilities are proposed. A general heuristic algorithm for any metric or environment (network or continuous space) is presented. The algorithm is based on solving several p-median problems.
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.
