Author:
Drwal Maciej,Jozefczyk Jerzy
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference35 articles.
1. Adams, W., Forrester, R., & Glover, F. (2004). Comparisons and enhancement strategies for linearizing mixed 0–1 quadratic programs. Discrete Optimization, 1(2), 99–120.
2. Baev, I., & Rajaraman, R. (2001). Approximation algorithms for data placement in arbitrary networks. In Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms (pp. 661–670). Philadelphia: Society for Industrial and Applied Mathematics.
3. Baev, I., Rajaraman, R., & Swamy, C. (2008). Approximation algorithms for data placement problems. SIAM Journal on Computing, 38(4), 1411–1429.
4. Bateni, M., & Hajiaghayi, M. (2009). Assignment problem in content distribution networks: unsplittable hard-capacitated facility location. In Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms (pp. 805–814). Philadelphia: Society for Industrial and Applied Mathematics.
5. Bektas, T., Oguz, O., & Ouveysi, I. (2007). Designing cost-effective content distribution networks. Computers & Operations Research, 34(8), 2436–2449.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献