Author:
Brimberg Jack,ReVelle Charles
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Statistics and Probability,Management Science and Operations Research,Information Systems and Management,Modelling and Simulation
Reference13 articles.
1. Balinski, M. (1965). Integer programming: methods, uses, computation.Management Science,12, 254–313.
2. Bilde, O. and Krarup, J. (1977). Sharp lower bounds and efficient algorithms for the simple plant location problem.Annals of Discrete Mathematics,1, 79–97.
3. Converse, A.O. (1972). Optimum number and location of treatment plants.Journal of Water Pollution Control Federation,44, 1629–1636.
4. Davis, P.S. and Ray, T.L. (1969). A branch-bound algorithm for the capacitated facilities location problem.Naval Research Logistics Quarterly,16, 331–344.
5. Efroymson, M.A. and Ray, T.L. (1966). A banch-and-bound algorithm for plant location.Operations Research,14, 361–368.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献