Abstract
This paper develops a new lower bound for single facility location problems withl p distances. We prove that the method produces superior results to other known procedures. The new bound is also computationally efficient. Numerical results are given for a range of examples with varying numbers of existing facilities andp values.
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.
