Solving a Class of Two-Dimensional Uncapacitated Location-Allocation Problems by Dynamic Programming
Published Online:1 Oct 1998https://doi.org/10.1287/opre.46.5.702
References
- Location-allocation problems. Opns. Res. (1963) 11 331 343 Link, Google Scholar
- Heuristic method for location-allocation problems. SIAM Rev. (1964) 6 37 53 Crossref, Google Scholar
- The transportation-location problem. Opns. Res. (1972) 20 94 108 Link, Google Scholar
- The planar two-center and two-median problems. Trans. Sci. (1984) 18 351 361 Link, Google Scholar
- Distribution Management: Mathematical Modelling and Practical Analysis (1971) (Hafner, New York) Google Scholar
- Improved complexity bounds for location problems on the real line. O. R. Lett. (1991) 10 395 402 Crossref, Google Scholar
- Exact and approximate solutions to the multisource Weber problem. Math. Prog. (1972) 3 193 209 Crossref, Google Scholar
- One-dimensional facility location-allocation using dynamic programming. Management Sci. (1976) 22 614 617 Link, Google Scholar
- Properties and solution methods for large location-allocation problems. J. Opnl. Res. Soc. (1982) 33 443 452 Google Scholar
- A computation procedure for the exact solution of location-allocation problems with rectangular distances. Naval Res. Logist. (1975) 22 441 453 Crossref, Google Scholar
- Facilities Location: Models and Methods (1988) (Prentice-Hall, (formerly North-Holland), New York) Google Scholar
- An efficient algorithm for solving the two-center location-allocation problem. J. Reg. Sci. (1975) 15 209 216 Crossref, Google Scholar
- Localization in single facility location. Eur. J. Opnl. Res. (1984) 18 215 219 Crossref, Google Scholar
- Location theory, dominance, and convexity. Opns. Res. (1973) 21 314 320 Link, Google Scholar

