A New Algorithm for the Single Source Weber Problem with Limited Distances

Published Online:https://doi.org/10.1287/trsc.2021.1083

References

  • 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.Google Scholar
  • Drezner Z, Mehrez A, Wesolowsky GO (1991) The facility location problem with limited distances. Transportation Sci. 25(3):183–187.LinkGoogle Scholar
  • Ostresh LM Jr. (1978) On the convergence of a class of iterative methods for solving the Weber location problem. Oper. Res. 26(4):597–609.LinkGoogle Scholar
  • Venkateshan P (2020) A note on “The Facility Location Problem With Limited Distances.” Transportation Sci. 54(6):1439–1445.LinkGoogle Scholar
  • Weiszfeld A (1937) Sur le point pour lequel la somme des distances de n points donnés est minimum. Tohoku Math. J. (2) 34:355–386.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.