Author:
ReVelle Charles,Marianov Vladimir
Reference47 articles.
1. Balinski, M. (1965). Integer programming: Methods, uses and computations. Management Science, 12, 253–313.
2. Bilde, O., & Krarup, J. (1977). Sharp lower bounds and efficient algorithms for the simple plant location problem. Annals Discrete Mathematics, 1, 79–97.
3. Brimberg, J., & Love, R. (1995). Estimating distances. In Z. Drezner (Ed.), Facility location: A survey of applications and methods (pp. 9–31). New York: Springer.
4. Brimberg, J., Hansen, P., Mladenovic, N., & Salhi, S. (2008). A survey of solution methods for the continuous location-allocation problem. International Journal of Operations Research, 5, 1–12.
5. Campbell, J. F., Ernst, A. T., & Krishnamoorthy, M. (2002). Hub location problems. In Z. Drezner & H. W. Hamacher (Eds.), Facility locations applications and theory (pp. 373–407). New York: Springer.