Location-Allocation Problems

Published Online:https://doi.org/10.1287/opre.11.3.331

The calculational aspects of solving certain classes of location-allocation problems are presented. Both exact extremal equations and a heuristic method are presented for solving these problems. Directions for further investigation are also indicated because of the need for methods to shorten the total amount of calculation involved.

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.