{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:27:36Z","timestamp":1760819256588},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,3]]},"DOI":"10.1016\/s0377-2217(99)00036-3","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"412-419","source":"Crossref","is-referenced-by-count":10,"title":["A multiperiod planning model for the capacitated minimal spanning tree problem"],"prefix":"10.1016","volume":"121","author":[{"given":"R.","family":"Kawatra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Bricker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0377-2217(99)00036-3_BIB1","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/mnsc.34.3.331","article-title":"Heuristics with constant error guarantees for the design of tree networks","volume":"34","author":"Altinkemer","year":"1988","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00036-3_BIB2","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1109\/T-C.1972.223452","article-title":"The design of multipoint linkages in a teleprocessing tree network","volume":"21","author":"Chandy","year":"1972","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"10.1016\/S0377-2217(99)00036-3_BIB3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.3230030204","article-title":"The capacitated minimum spanning tree","volume":"3","author":"Chandy","year":"1973","journal-title":"Networks"},{"issue":"3","key":"10.1016\/S0377-2217(99)00036-3_BIB4","first-page":"166","article-title":"On teleprocessing system design","volume":"5","author":"Esau","year":"1966","journal-title":"IBM Systems Journal"},{"issue":"1","key":"10.1016\/S0377-2217(99)00036-3_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangian relaxation method for solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Science"},{"issue":"1","key":"10.1016\/S0377-2217(99)00036-3_BIB6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/net.3230010105","article-title":"Optimal design of centralized computer networks","volume":"1","author":"Frank","year":"1971","journal-title":"Networks"},{"issue":"2","key":"10.1016\/S0377-2217(99)00036-3_BIB7","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230120402","article-title":"Topological design of centralized computer networks, formulations and algorithms","volume":"12","author":"Gavish","year":"1982","journal-title":"Networks"},{"issue":"1","key":"10.1016\/S0377-2217(99)00036-3_BIB8","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322358.322367","article-title":"Formulations and algorithms for the capacitated minimal directed tree problem","volume":"30","author":"Gavish","year":"1983","journal-title":"Journal of the ACM"},{"issue":"12","key":"10.1016\/S0377-2217(99)00036-3_BIB9","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1109\/TCOM.1985.1096250","article-title":"Augmented lagrangian based algorithm for centralized network design","volume":"33","author":"Gavish","year":"1985","journal-title":"IEEE Transaction on Communications"},{"key":"10.1016\/S0377-2217(99)00036-3_BIB10","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.43.1.130","article-title":"A 2n-constraint formulation for the capacitated minimal spanning tree problem","volume":"43","author":"Gouveia","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00036-3_BIB11","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"5","author":"Held","year":"1974","journal-title":"Mathematical Programming"},{"issue":"11","key":"10.1016\/S0377-2217(99)00036-3_BIB12","doi-asserted-by":"crossref","first-page":"1762","DOI":"10.1109\/TCOM.1974.1092123","article-title":"A unified algorithm for designing multidrop teleprocessing networks","volume":"22","author":"Kershenbaum","year":"1974","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S0377-2217(99)00036-3_BIB13","doi-asserted-by":"crossref","first-page":"1835","DOI":"10.1109\/TCOM.1980.1094601","article-title":"Second order greedy algorithm for centralized teleprocessing network design","volume":"28","author":"Kershenbaum","year":"1980","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S0377-2217(99)00036-3_BIB14","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/net.3230130211","article-title":"Centralized teleprocessing network design","volume":"13","author":"Kershenbaum","year":"1983","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00036-3_BIB15","unstructured":"R. Larson, A. Odoni, Urban Operations Research, Prentice Hall, Englewood Cliffs, NJ, 1981"},{"key":"10.1016\/S0377-2217(99)00036-3_BIB16","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/net.3230080306","article-title":"The complexity of the capacitated tree problem","volume":"8","author":"Papadimitriou","year":"1978","journal-title":"Networks"},{"issue":"10","key":"10.1016\/S0377-2217(99)00036-3_BIB17","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1016\/S0305-0548(97)00096-8","article-title":"A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution","volume":"25","author":"Pirkul","year":"1998","journal-title":"Computers and Operations Research"},{"issue":"3","key":"10.1016\/S0377-2217(99)00036-3_BIB18","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0305-0548(87)90022-0","article-title":"Efficient algorithms for the capacitated concentrator location problem","volume":"14","author":"Pirkul","year":"1987","journal-title":"Computers and Operations Research"},{"issue":"4","key":"10.1016\/S0377-2217(99)00036-3_BIB19","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1109\/26.2769","article-title":"Locating concentrators for primary and secondary coverage in a computer communications network","volume":"36","author":"Pirkul","year":"1988","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S0377-2217(99)00036-3_BIB20","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Systems Technical Journal"},{"issue":"3","key":"10.1016\/S0377-2217(99)00036-3_BIB21","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0305-0548(88)90033-0","article-title":"The design of centralized networks with reliability and availability constraints","volume":"15","author":"Woolston","year":"1988","journal-title":"Computers and Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799000363?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799000363?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T19:52:09Z","timestamp":1555962729000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799000363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0377221799000363"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00036-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}