{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T09:48:11Z","timestamp":1747907291485},"reference-count":25,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1982,11,1]],"date-time":"1982-11-01T00:00:00Z","timestamp":404956800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks (1976)"],"published-print":{"date-parts":[[1982,11]]},"DOI":"10.1016\/0376-5075(82)90104-0","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T19:11:16Z","timestamp":1060283476000},"page":"345-357","source":"Crossref","is-referenced-by-count":21,"title":["Optimal file allocation in a computer network: a solution method based on the knapsack problem"],"prefix":"10.1016","volume":"6","author":[{"given":"S","family":"Ceri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G","family":"Martella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G","family":"Pelagatti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"N. 10","key":"10.1016\/0376-5075(82)90104-0_BIB1","doi-asserted-by":"crossref","DOI":"10.1109\/T-C.1969.222542","article-title":"Optimal File Allocation in a Multiple Computer System","volume":"vol. C-18","author":"Chu","year":"1969","journal-title":"IEEE Transactions on Computer"},{"key":"10.1016\/0376-5075(82)90104-0_BIB2","article-title":"Allocation of copies of a file in an Information Network","author":"Casey","year":"1972","journal-title":"AFIPS rSJCC"},{"key":"10.1016\/0376-5075(82)90104-0_BIB3","article-title":"Placement of records in a file and file allocation in a computer network","author":"Eswaran","year":"1974"},{"issue":"N. 1","key":"10.1016\/0376-5075(82)90104-0_BIB4","doi-asserted-by":"crossref","DOI":"10.1145\/320434.320449","article-title":"Optimal allocation of resources in distributed information networks","volume":"vol. 1","author":"Mahmoud","year":"1976","journal-title":"ACM Transactions on Database Systems"},{"issue":"n. 5","key":"10.1016\/0376-5075(82)90104-0_BIB5","doi-asserted-by":"crossref","DOI":"10.1145\/359581.359591","article-title":"Optimal program and data locations in computer networks","volume":"Vol. 20","author":"Morgan","year":"1977","journal-title":"CACM"},{"key":"10.1016\/0376-5075(82)90104-0_BIB6","series-title":"Proc. 1st Int. Conference on Distributed Computing Systems","article-title":"The placement of relations on a distributed relational data base","author":"Ramamoorthy","year":"1979"},{"key":"10.1016\/0376-5075(82)90104-0_BIB7","series-title":"Proc. 1st Int. Conference on Distributed Computing Systems","article-title":"A model for a combined communication network design and file allocation for distributed database","author":"Irani","year":"1979"},{"issue":"N. 3","key":"10.1016\/0376-5075(82)90104-0_BIB8","doi-asserted-by":"crossref","DOI":"10.1109\/TSE.1979.234179","article-title":"Query processing in distributed databases","volume":"Vol. SE-5","author":"Hevner","year":"1979","journal-title":"IEEE Trans. on Software Engineering"},{"key":"10.1016\/0376-5075(82)90104-0_BIB9","series-title":"Proc. Berkeley Workshop on Distributed Data Management and Computer Networks","article-title":"Retrieving dispersed data from SDD-1, A system for distributed databases","author":"Wong","year":"1977"},{"key":"10.1016\/0376-5075(82)90104-0_BIB10","series-title":"Data Base Architeture","article-title":"A model of an access strategy in a distributed database","author":"Pelagatti","year":"1979"},{"issue":"N. 2","key":"10.1016\/0376-5075(82)90104-0_BIB11","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1982.1675957","article-title":"Allocation of operations in distributed database access","volume":"vol. C-31","author":"Ceri","year":"1982","journal-title":"IEEE Trans. on Computers"},{"key":"10.1016\/0376-5075(82)90104-0_BIB12","series-title":"Proc. EURO-IFIP Congress","article-title":"A query processing strategy for distributed databases","author":"Baldissera","year":"1979"},{"key":"10.1016\/0376-5075(82)90104-0_BIB13","series-title":"Proc. NYU Symposium on Database Design","article-title":"An integrated approach to logical database design","author":"Yao","year":"1978"},{"key":"10.1016\/0376-5075(82)90104-0_BIB14","series-title":"Proc. of the NYU Symposium on Database Design","article-title":"Praticalities in applying a formal methodology to data analysis","author":"Palmer","year":"1978"},{"key":"10.1016\/0376-5075(82)90104-0_BIB15","article-title":"Logical database design: A pragmatic approach","author":"Theorey","year":"1978"},{"key":"10.1016\/0376-5075(82)90104-0_BIB16","series-title":"Integer Programming","author":"Salkin","year":"1975"},{"key":"10.1016\/0376-5075(82)90104-0_BIB17","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1287\/mnsc.18.9.465","article-title":"Integer program algorithms: a framework and a statement of the art survey","volume":"vol. 18","author":"Geoffrion","year":"1972","journal-title":"Management Sciences"},{"issue":"N. 2","key":"10.1016\/0376-5075(82)90104-0_BIB18","doi-asserted-by":"crossref","DOI":"10.1016\/0377-2217(78)90108-X","article-title":"The 0\u20131 knapsack problem with multiple choice constraints","volume":"vol. 2","author":"Nauss","year":"1978","journal-title":"European Journal of Operations Research"},{"issue":"1","key":"10.1016\/0376-5075(82)90104-0_BIB19","article-title":"Methods for the solution of the multidimensional 0\/1 knapsack problem","volume":"15","author":"Weigartner","year":"1967","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/0376-5075(82)90104-0_BIB20","doi-asserted-by":"crossref","DOI":"10.1287\/opre.21.1.135","article-title":"Concave programming applied to a special class of 0\u20131 integer programs","volume":"21","author":"Glover","year":"1973","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/0376-5075(82)90104-0_BIB21","article-title":"An all zero-one algorithm for a certain class of transportation problems","volume":"19","author":"De Maio","year":"1971","journal-title":"Operations Research"},{"issue":"N. 6","key":"10.1016\/0376-5075(82)90104-0_BIB22","article-title":"An algorithm and efficient data structure for the binary knapsack problem","volume":"vol. 2","author":"Sahl","year":"1978","journal-title":"European Journal of Operations Research"},{"issue":"2","key":"10.1016\/0376-5075(82)90104-0_BIB23","doi-asserted-by":"crossref","DOI":"10.1287\/opre.23.2.207","article-title":"When the greedy solution solves a class of knapsack problems","volume":"23","author":"Magazine","year":"1975","journal-title":"Operations Research"},{"key":"10.1016\/0376-5075(82)90104-0_BIB24","article-title":"Computational results with a branch and bound algorithm for the general knapsack problem","volume":"vol. 1","author":"Bulfin","year":"1979","journal-title":"Naval Research Logistic Quarterly"},{"key":"10.1016\/0376-5075(82)90104-0_BIB25","series-title":"Proc. on the Int. Conference on Data Bases","article-title":"Optimal file allocation for a distributed database on a network of minicomputers","author":"Ceri","year":"1980"}],"container-title":["Computer Networks (1976)"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0376507582901040?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0376507582901040?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T03:55:24Z","timestamp":1552622124000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0376507582901040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,11]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1982,11]]}},"alternative-id":["0376507582901040"],"URL":"https:\/\/doi.org\/10.1016\/0376-5075(82)90104-0","relation":{},"ISSN":["0376-5075"],"issn-type":[{"value":"0376-5075","type":"print"}],"subject":[],"published":{"date-parts":[[1982,11]]}}}