{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:14:21Z","timestamp":1761401661593},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,2,27]],"date-time":"2013-02-27T00:00:00Z","timestamp":1361923200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s10479-013-1330-7","type":"journal-article","created":{"date-parts":[[2013,2,26]],"date-time":"2013-02-26T07:40:23Z","timestamp":1361864423000},"page":"261-277","source":"Crossref","is-referenced-by-count":6,"title":["Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding"],"prefix":"10.1007","volume":"222","author":[{"given":"Maciej","family":"Drwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerzy","family":"Jozefczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,27]]},"reference":[{"issue":"2","key":"1330_CR1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.disopt.2004.03.006","volume":"1","author":"W. Adams","year":"2004","unstructured":"Adams, W., Forrester, R., & Glover, F. (2004). Comparisons and enhancement strategies for linearizing mixed 0\u20131 quadratic programs. Discrete Optimization, 1(2), 99\u2013120.","journal-title":"Discrete Optimization"},{"key":"1330_CR2","first-page":"661","volume-title":"Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms","author":"I. Baev","year":"2001","unstructured":"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\u2013670). Philadelphia: Society for Industrial and Applied Mathematics."},{"issue":"4","key":"1330_CR3","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1137\/080715421","volume":"38","author":"I. Baev","year":"2008","unstructured":"Baev, I., Rajaraman, R., & Swamy, C. (2008). Approximation algorithms for data placement problems. SIAM Journal on Computing, 38(4), 1411\u20131429.","journal-title":"SIAM Journal on Computing"},{"key":"1330_CR4","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1137\/1.9781611973068.88","volume-title":"Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms","author":"M. Bateni","year":"2009","unstructured":"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\u2013814). Philadelphia: Society for Industrial and Applied Mathematics."},{"issue":"8","key":"1330_CR5","doi-asserted-by":"crossref","first-page":"2436","DOI":"10.1016\/j.cor.2005.09.013","volume":"34","author":"T. Bektas","year":"2007","unstructured":"Bektas, T., Oguz, O., & Ouveysi, I. (2007). Designing cost-effective content distribution networks. Computers & Operations Research, 34(8), 2436\u20132449.","journal-title":"Computers & Operations Research"},{"issue":"12","key":"1330_CR6","doi-asserted-by":"crossref","first-page":"3860","DOI":"10.1016\/j.cor.2007.02.005","volume":"35","author":"T. Bektas","year":"2008","unstructured":"Bektas, T., Cordeau, J., Erkut, E., & Laporte, G. (2008). Exact algorithms for the joint object placement and request routing problem in content distribution networks. Computers & Operations Research, 35(12), 3860\u20133884.","journal-title":"Computers & Operations Research"},{"key":"1330_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2003-6","volume-title":"Assignment problems in parallel and distributed computing","author":"S. Bokhari","year":"1987","unstructured":"Bokhari, S. (1987). Assignment problems in parallel and distributed computing. Berlin: Springer."},{"issue":"1","key":"1330_CR8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1109\/JPROC.2006.887322","volume":"95","author":"M. Chiang","year":"2007","unstructured":"Chiang, M., Low, S., Calderbank, A., & Doyle, J. (2007). Layering as optimization decomposition: a mathematical theory of network architectures. Proceedings of the IEEE, 95(1), 255\u2013312.","journal-title":"Proceedings of the IEEE"},{"key":"1330_CR9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/1011767.1011771","volume-title":"Proceedings of the 23rd annual ACM symposium on principles of distributed computing","author":"B. Chun","year":"2004","unstructured":"Chun, B., Chaudhuri, K., Wee, H., Barreno, M., Papadimitriou, C., & Kubiatowicz, J. (2004). Selfish caching in distributed systems: a game-theoretic analysis. In Proceedings of the 23rd annual ACM symposium on principles of distributed computing (pp. 21\u201330). New York: ACM."},{"issue":"4","key":"1330_CR10","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/1054916.1054931","volume":"35","author":"M. Elkin","year":"2004","unstructured":"Elkin, M. (2004). Distributed approximation: a survey. ACM SIGACT News, 35(4), 40\u201357.","journal-title":"ACM SIGACT News"},{"issue":"1","key":"1330_CR11","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF02094329","volume":"36","author":"B. Gavish","year":"1992","unstructured":"Gavish, B., & Suh, M. (1992). Configuration of fully replicated distributed database system over wide area networks. Annals of Operations Research, 36(1), 167\u2013191.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"1330_CR12","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1002\/net.10080","volume":"42","author":"M. Hajiaghayi","year":"2003","unstructured":"Hajiaghayi, M., Mahdian, M., & Mirrokni, V. (2003). The facility location problem with general cost functions. Networks, 42(1), 42\u201347.","journal-title":"Networks"},{"issue":"1","key":"1330_CR13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/A:1026110926707","volume":"123","author":"T. Hale","year":"2003","unstructured":"Hale, T., & Moberg, C. (2003). Location science research: a review. Annals of Operations Research, 123(1), 21\u201335.","journal-title":"Annals of Operations Research"},{"key":"1330_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-30162-4","volume-title":"Encyclopedia of algorithms","author":"M. Kao","year":"2008","unstructured":"Kao, M. (2008). Encyclopedia of algorithms. Berlin: Springer."},{"key":"1330_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack problems. Berlin: Springer."},{"key":"1330_CR16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1057\/palgrave.jors.2600523","volume":"49","author":"F. Kelly","year":"1998","unstructured":"Kelly, F., Maulloo, A., & Tan, D. (1998). Rate control for communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49, 237\u2013252.","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"1330_CR17","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1109\/TKDE.2008.171","volume":"21","author":"S. Khan","year":"2009","unstructured":"Khan, S., & Ahmad, I. (2009). A pure Nash equilibrium-based game theoretical method for data replication across multiple servers. IEEE Transactions on Knowledge and Data Engineering, 21(4), 537\u2013553.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"1330_CR18","first-page":"586","volume-title":"Proceedings of the tenth annual ACM-SIAM symposium on discrete algorithms","author":"M. Korupolu","year":"1999","unstructured":"Korupolu, M., Plaxton, C., & Rajaraman, R. (1999). Placement algorithms for hierarchical cooperative caching. In Proceedings of the tenth annual ACM-SIAM symposium on discrete algorithms (pp. 586\u2013595). Philadelphia: Society for Industrial and Applied Mathematics."},{"issue":"3","key":"1330_CR19","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1109\/TC.1983.1676215","volume":"100","author":"L. Laning","year":"1983","unstructured":"Laning, L., & Leonard, M. (1983). File allocation in a distributed computer communication network. IEEE Transactions on Computers, 100(3), 232\u2013244.","journal-title":"IEEE Transactions on Computers"},{"issue":"12","key":"1330_CR20","doi-asserted-by":"crossref","first-page":"1401","DOI":"10.1109\/TPDS.2006.171","volume":"17","author":"N. Laoutaris","year":"2006","unstructured":"Laoutaris, N., Telelis, O., Zissimopoulos, V., & Stavrakakis, I. (2006). Distributed selfish replication. IEEE Transactions on Parallel and Distributed Systems, 17(12), 1401\u20131413.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"2","key":"1330_CR21","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/1461928.1461944","volume":"52","author":"T. Leighton","year":"2009","unstructured":"Leighton, T. (2009). Improving performance on the Internet. Communications of the ACM, 52(2), 44\u201351.","journal-title":"Communications of the ACM"},{"key":"1330_CR22","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1145\/129712.129787","volume-title":"Proceedings of the twenty-fourth annual ACM symposium on theory of computing","author":"J. Lin","year":"1992","unstructured":"Lin, J., & Vitter, J. (1992). e-Approximations with minimum packing constraint violation. In Proceedings of the twenty-fourth annual ACM symposium on theory of computing (pp. 771\u2013782). New York: ACM."},{"issue":"1","key":"1330_CR23","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02094327","volume":"36","author":"O. Liu Sheng","year":"1992","unstructured":"Liu Sheng, O., & Lee, H. (1992). Data allocation design in computer networks: LAN versus MAN versus WAN. Annals of Operations Research, 36(1), 125\u2013149.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"1330_CR24","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1137\/S0097539795287824","volume":"28","author":"C. Lund","year":"1999","unstructured":"Lund, C., Reingold, N., Westbrook, J., & Yan, D. (1999). Competitive on-line algorithms for distributed data management. SIAM Journal on Computing, 28(3), 1086\u20131111.","journal-title":"SIAM Journal on Computing"},{"key":"1330_CR25","first-page":"409","volume-title":"Proceedings of 11th European symposium on algorithms","author":"M. Mahdian","year":"2003","unstructured":"Mahdian, M., & P\u00e1l, M. (2003). Universal facility location. In Proceedings of 11th European symposium on algorithms (pp. 409\u2013421)."},{"issue":"6","key":"1330_CR26","doi-asserted-by":"crossref","first-page":"3260","DOI":"10.1137\/080743706","volume":"20","author":"D. Mosk-Aoyama","year":"2010","unstructured":"Mosk-Aoyama, D., Roughgarden, T., & Shah, D. (2010). Fully distributed algorithms for convex optimization problems. SIAM Journal on Optimization, 20(6), 3260\u20133279.","journal-title":"SIAM Journal on Optimization"},{"key":"1330_CR27","first-page":"121","volume-title":"Proceedings of the 25th annual ACM symposium on theory of computing","author":"C. Papadimitriou","year":"1993","unstructured":"Papadimitriou, C., & Yannakakis, M. (1993). Linear programming without the matrix. In Proceedings of the 25th annual ACM symposium on theory of computing (pp. 121\u2013129). New York: ACM."},{"issue":"3","key":"1330_CR28","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0377-2217(86)90142-6","volume":"26","author":"H. Pirkul","year":"1986","unstructured":"Pirkul, H. (1986). An integer programming model for the allocation of databases in a distributed computer system. European Journal of Operational Research, 26(3), 401\u2013411.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"1330_CR29","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., & Tompson, C. (1987). Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4), 365\u2013374.","journal-title":"Combinatorica"},{"issue":"10","key":"1330_CR30","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1109\/TPDS.2006.145","volume":"17","author":"G. Rodolakis","year":"2006","unstructured":"Rodolakis, G., Siachalou, S., & Georgiadis, L. (2006). Replicated server placement with QoS constraints. IEEE Transactions on Parallel and Distributed Systems, 17(10), 1151\u20131162.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"1330_CR31","first-page":"1863","volume-title":"IEEE international symposium on information theory","author":"O. Shental","year":"2008","unstructured":"Shental, O., Siegel, P., Wolf, J., Bickson, D., & Dolev, D. (2008). Gaussian belief propagation solver for systems of linear equations. In IEEE international symposium on information theory (pp. 1863\u20131867). New York: IEEE Press."},{"issue":"3","key":"1330_CR32","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/1035570.1035573","volume":"36","author":"S. Sivasubramanian","year":"2004","unstructured":"Sivasubramanian, S., Szymaniak, M., Pierre, G., & Steen, M. (2004). Replication for web hosting systems. ACM Computing Surveys, 36(3), 291\u2013334.","journal-title":"ACM Computing Surveys"},{"key":"1330_CR33","volume-title":"Computer networks","author":"A. Tanenbaum","year":"2003","unstructured":"Tanenbaum, A. (2003). Computer networks (4th ed.). New York: Prentice Hall.","edition":"4"},{"key":"1330_CR34","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511921735","volume-title":"The design of approximation algorithms","author":"D. Williamson","year":"2011","unstructured":"Williamson, D., & Shmoys, D. (2011). The design of approximation algorithms. Cambridge: Cambridge University Press."},{"issue":"2","key":"1330_CR35","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/249978.249982","volume":"22","author":"O. Wolfson","year":"1997","unstructured":"Wolfson, O., Jajodia, S., & Huang, Y. (1997). An adaptive data replication algorithm. ACM Transactions on Database Systems, 22(2), 255\u2013314.","journal-title":"ACM Transactions on Database Systems"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1330-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-013-1330-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1330-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T19:31:20Z","timestamp":1688067080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-013-1330-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,27]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["1330"],"URL":"https:\/\/doi.org\/10.1007\/s10479-013-1330-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,27]]}}}