Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/24372
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVenkateshan, Prahalad-
dc.date.accessioned2021-10-14T09:12:57Z-
dc.date.available2021-10-14T09:12:57Z-
dc.date.issued2020-09-14-
dc.identifier.citationPrahalad Venkateshan (2020) A Note on “The Facility Location Problem with Limited Distances”. Transportation Science 54(6):1439-1445. https://doi.org/10.1287/trsc.2020.0992en_US
dc.identifier.otherhttps://doi.org/10.1287/trsc.2020.0992-
dc.identifier.urihttp://hdl.handle.net/11718/24372-
dc.description.abstractIn this paper, it is shown that the polynomially bounded enumerative procedure to solve the facility location problem with limited distances, originally described by Drezner, Mehrez, and Wesolowsky [Drezner Z, Mehrez A, Wesolowsky GO (1991) The facility location problem with limited distances. Transportation Sci. 25(3):183–187.], and subsequently corrected by Aloise, Hansen, and Liberti [Aloise D, Hansen P, Liberti L (2012) An improved column generation algorithm for minimum sum-of-squares clustering. Math. Programming 131(1–2):195–220.], can still fail to optimally solve the problem. Conditions under which the procedures succeed are identified. A new modified algorithm is presented that solves the facility location problem with limited distances. It is further shown that the proposed correction is complete in that it does not require further corrections.en_US
dc.language.isoenen_US
dc.publisherTransportation Scienceen_US
dc.subjectSingle-source Weber problemen_US
dc.subjectLocation problem with limited distancesen_US
dc.titleA note on “the facility location problem with limited distances”en_US
dc.typeArticleen_US
Appears in Collections:Journal Articles

Files in This Item:
There are no files associated with this item.


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.