Abstract
Many practical location decision problems require facility locations to be restricted to a finite set of points. Quite often such restrictions arise from natural constraints that are specific to the application setting. Motivated by such situations, this paper examines the Stochastic Queue Median (SQM) model of Berman, Larson and Chiu, where potential facility locations are restricted to a finite set of discrete points. An efficient algorithm is presented to solve for the optimal facility location parametrically in the systemwide arrival rate of calls. The complexity of the algorithm and a worst case analysis for the model formulation are also discussed.
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.
