Author:
Irawan Chandra Ade,Luis Martino,Salhi Said,Imran Arif
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference54 articles.
1. Akyüs, M. H., Altnel, I. K., & Öncan, T. (2014). Location and allocation based branch and bound algorithms for the capacitated multi-facility weber problem. Annals of Operations Research, 222(1), 45–71.
2. Aras, N., Altnel, I. K., & Orbay, M. (2007a). New heuristic methods for the capacitated multi-facility weber problem. Naval Research Logistics, 54, 21–32.
3. Aras, N., Yumusak, S., & Altnel, I. K. (2007b). Solving the capacitated multi-facility weber problem by simulated annealing, threshold accepting and genetic algorithms. In K. F. Doerner, P. G. Gendreau, W. J. Gutjahr, R. F. Hartl, & M. Reimann (Eds.), Progress in complex systems optimization: Metaheuristics (pp. 91–112). Berlin: Springer.
4. Aras, N., Orbay, M., & Altnel, I. K. (2008). Efficient heuristics for the rectilinear distance capacitated multi-facility weber problem. Journal of the Operational Research Society, 59, 64–79.
5. Arostegui, M. A, Jr., Kadipasaoglu, S. N., & Khumawala, B. M. (2008). An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems. International Journal of Production Economics, 103, 742–754.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献