{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:46:55Z","timestamp":1742798815861},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1007\/bf02094329","type":"journal-article","created":{"date-parts":[[2005,9,12]],"date-time":"2005-09-12T10:16:52Z","timestamp":1126520212000},"page":"167-191","source":"Crossref","is-referenced-by-count":11,"title":["Configuration of fully replicated distributed database system over wide area networks"],"prefix":"10.1007","volume":"36","author":[{"given":"Bezalel","family":"Gavish","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Myung W.","family":"Suh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02094329_CR1","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF02591740","volume":"37","author":"E. Allen","year":"1987","unstructured":"E. Allen et al., A generalization of Polyak's convergence result for subgradient optimization, Math. Progr. 37 (1987) 309\u2013317.","journal-title":"Math. Progr."},{"key":"BF02094329_CR2","unstructured":"P.M.G. Apers, Query processing and data allocation in distributed database systems, Mathematisch Centrum (1983)."},{"key":"BF02094329_CR3","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1109\/TSE.1978.231494","volume":"SE-4","author":"P.A. Bernstein","year":"1978","unstructured":"P.A. Bernstein, M. Goodman, J.B. Rothnie and C.A. Papadimitriou, The concurrency control mechanism of SDD-1: a system for distributed databases (the fully redundant case), IEEE Trans. Software Eng. SE-4 (1978) 154\u2013168.","journal-title":"IEEE Trans. Software Eng."},{"key":"BF02094329_CR4","unstructured":"R.G. Casey, Allocation of copies of a file in an information network,Proc. AFIPS 1972 Spring Joint Computer Conf. (1972) pp. 617\u2013625."},{"key":"BF02094329_CR5","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/T-C.1969.222542","volume":"C-18","author":"W.W. Chu","year":"1969","unstructured":"W.W. Chu, Optimal file allocation in multiple computer systems, IEEE Trans. Comput. C-18 (1969) 885\u2013889.","journal-title":"IEEE Trans. Comput."},{"key":"BF02094329_CR6","unstructured":"D.W. Cornell and P.S. Yu, Relation assignment in distributed transaction processing environment,Proc. 7th Int. Conf. on Distributed Computing Systems (1987) pp. 50\u201355."},{"key":"BF02094329_CR7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1145\/356876.356883","volume":"14","author":"L.W. Dowdy","year":"1982","unstructured":"L.W. Dowdy and D.V. Foster, Comparative models of the file assignment problem, ACM Comput. Surveys 14 (1982) 287\u2013313.","journal-title":"ACM Comput. Surveys"},{"key":"BF02094329_CR8","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D. Erlenkotter","year":"1978","unstructured":"D. Erlenkotter, A dual-based procedure for uncapacitated plant location, Oper. Res. 26 (1978) 992\u20131009.","journal-title":"Oper. Res."},{"key":"BF02094329_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"M.L. Fisher, Lagrangian relaxation method for solving integer programming, Manag. Sci. 27 (1981) 1\u201318.","journal-title":"Manag. Sci."},{"key":"BF02094329_CR10","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230120402","volume":"12","author":"B. Gavish","year":"1982","unstructured":"B. Gavish, Topological design of centralized computer networks: formulations and algorithms, Network 12 (1982) 355\u2013377.","journal-title":"Network"},{"key":"BF02094329_CR11","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322358.322367","volume":"30","author":"B. Gavish","year":"1984","unstructured":"B. Gavish, Formulations and algorithms for the capacitated minimal directed tree problem, J. ACM 30 (1984) 118\u2013132.","journal-title":"J. ACM"},{"key":"BF02094329_CR12","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1002\/j.1538-7305.1985.tb00360.x","volume":"64","author":"B. Gavish","year":"1985","unstructured":"B. Gavish, Models for configuring large-scale distributed computing systems, AT&T Tech. J. 64 (1985) 491\u2013532.","journal-title":"AT&T Tech. J."},{"key":"BF02094329_CR13","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1109\/TC.1987.1676975","volume":"36","author":"B. Gavish","year":"1987","unstructured":"B. Gavish, Optimization models for configuring distributed computing systems, IEEE Trans. Comput. 36 (1987) 773\u2013793.","journal-title":"IEEE Trans. Comput."},{"key":"BF02094329_CR14","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1109\/TCOM.1983.1095752","volume":"COM-31","author":"B. Gavish","year":"1983","unstructured":"B. Gavish and S.L. Hantler, An algorithm for optimal route selection in SNA networks, IEEE Trans. Commun. COM-31 (1983) 1154\u20131161.","journal-title":"IEEE Trans. Commun."},{"key":"BF02094329_CR15","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BF02591863","volume":"31","author":"B. Gavish","year":"1985","unstructured":"B. Gavish and H. Pirkul, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, Math. Progr. 31 (1985) 78\u2013105.","journal-title":"Math. Progr."},{"key":"BF02094329_CR16","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/TC.1986.1676799","volume":"C-35","author":"B. Gavish","year":"1986","unstructured":"B. Gavish and H. Pirkul, Computer and database location in distributed computing systems, IEEE Trans. Comput. C-35 (1986) 583\u2013590.","journal-title":"IEEE Trans. Comput."},{"key":"BF02094329_CR17","unstructured":"B. Gavish and H. Pirkul, Distributed computer system design for large decentralized organizations,Proc. Int. Conf. on Information Systems (1986) pp. 116\u2013135."},{"key":"BF02094329_CR18","unstructured":"B. Gavish and M.W. Suh, Optimal configuration of two-tiered distributed database systems, Working Paper (1990)."},{"key":"BF02094329_CR19","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1080\/05695557808975181","volume":"10","author":"A.M. Geoffrion","year":"1978","unstructured":"A.M. Geoffrion and R. McBride, Lagrangian relaxation applied to capacitated plant location problem, Trans. AIIE 10 (1978) 40\u201347.","journal-title":"Trans. AIIE"},{"key":"BF02094329_CR20","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1287\/opre.18.5.924","volume":"18","author":"H.J. Greenberg","year":"1970","unstructured":"H.J. Greenberg and W.P. Pierskalla, Surrogate mathematical programming, Oper. Res. 18 (1970) 924\u2013939.","journal-title":"Oper. Res."},{"key":"BF02094329_CR21","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"M. Held and R.M. Karp, The travelling salesman problem and minimum spanning trees, Oper. Res. 18 (1970) 1138\u20131162.","journal-title":"Oper. Res."},{"key":"BF02094329_CR22","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M. Held","year":"1974","unstructured":"M. Held, P. Wolfe and H.P. Crowder, Validation of subgradient optimization, Math. Progr. 6 (1974) 62\u201388.","journal-title":"Math. Progr."},{"key":"BF02094329_CR23","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1109\/TC.1982.1676019","volume":"C-31","author":"K.B. Irani","year":"1982","unstructured":"K.B. Irani and N.G. Khabbaz, File allocation in a distributed computer communications network, IEEE Trans. Comput. C-31 (1982) 419\u2013434.","journal-title":"IEEE Trans. Comput."},{"key":"BF02094329_CR24","first-page":"824","volume":"C-32","author":"L.J. Lanning","year":"1983","unstructured":"L.J. Lanning and M.S. Leonard, File allocation in a distributed computer communication network, IEEE Trans. Comput. C-32 (1983) 824\u2013835.","journal-title":"IEEE Trans. Comput."},{"key":"BF02094329_CR25","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/320434.320449","volume":"1","author":"S. Mahmoud","year":"1976","unstructured":"S. Mahmoud and J.S. Riordon, Optimal allocation of resources in distributed information networks, ACM Trans. Database Systems 1 (1976) 66\u201378.","journal-title":"ACM Trans. Database Systems"},{"key":"BF02094329_CR26","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/359581.359591","volume":"20","author":"H.L. Morgan","year":"1977","unstructured":"H.L. Morgan and K.D. Levin, Optimal program and data locations in computer networks, Commun. ACM 20 (1977) 315\u2013321.","journal-title":"Commun. ACM"},{"key":"BF02094329_CR27","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/3148.3161","volume":"10","author":"D. Secca","year":"1985","unstructured":"D. Secca and G. Wiederhold, Database partitioning in a cluster of processors, ACM Trans. Database Systems 10 (1985) 29\u201356.","journal-title":"ACM Trans. Database Systems"},{"key":"BF02094329_CR28","unstructured":"C.T. Yu et al., File allocation in distributed database with interaction with files,Proc. Int. Conf. on Very Large Databases (1983) pp. 248\u2013259."},{"key":"BF02094329_CR29","first-page":"23","volume":"C-4","author":"B.W. Wah","year":"1984","unstructured":"B.W. Wah, File placement on distributed computer systems, IEEE Trans. Comput. C-4 (1984) 23\u201332.","journal-title":"IEEE Trans. Comput."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02094329.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02094329\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02094329","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T10:20:47Z","timestamp":1557829247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02094329"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["BF02094329"],"URL":"https:\/\/doi.org\/10.1007\/bf02094329","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}