{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:57:59Z","timestamp":1648612679380},"reference-count":12,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"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 Communications"],"published-print":{"date-parts":[[1997,7]]},"DOI":"10.1016\/s0140-3664(97)00043-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:56:11Z","timestamp":1027637771000},"page":"507-511","source":"Crossref","is-referenced-by-count":0,"title":["A minimal cost design for a large hierarchically clustered computer communication network considering a desired index of service"],"prefix":"10.1016","volume":"20","author":[{"given":"A","family":"Mukherjee","sequence":"first","affiliation":[]},{"given":"B.B","family":"Bhaumik","sequence":"additional","affiliation":[]},{"given":"A.K","family":"Bandyopadhyay","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(97)00043-1_BIB1","doi-asserted-by":"crossref","unstructured":"L. Klienrock, F. Kamoun, Optimal clustering structures for hierarchical topological design of large computer networks, Networks 10 (1980) 221\u2013248.","DOI":"10.1002\/net.3230100305"},{"key":"10.1016\/S0140-3664(97)00043-1_BIB2","doi-asserted-by":"crossref","unstructured":"A. Mukherjee, B.B. Bhaumik, A.K. Bandyopadhyay, Cost effective feasible clustering for hierarchical topological design of large computer communication network, in: Proceedings of IEEE on Energy, Computer, Communication and Control, New Delhi, India, 1991, pp. 99\u2013102.","DOI":"10.1109\/TENCON.1991.753846"},{"key":"10.1016\/S0140-3664(97)00043-1_BIB3","doi-asserted-by":"crossref","unstructured":"S.P. Dandumundi, D.L. Eager, Hierarchical interconnection networks for multicomputer systems, IEEE Trans. on Computer 39 (6) (1990) 786\u2013797.","DOI":"10.1109\/12.53600"},{"key":"10.1016\/S0140-3664(97)00043-1_BIB4","doi-asserted-by":"crossref","unstructured":"S. Narasimhan, H. Pirkul, Hierarchical concentrator location problem, Computer Communications 15 (3) (1992) 185\u2013191.","DOI":"10.1016\/0140-3664(92)90079-T"},{"key":"10.1016\/S0140-3664(97)00043-1_BIB5","unstructured":"J. Atkinson, Telephony II, Pitman, London, 1968."},{"key":"10.1016\/S0140-3664(97)00043-1_BIB6","doi-asserted-by":"crossref","unstructured":"A. Mukherjee, B.B. Bhaumik, A.K. Bandyopadhyay, Hierarchical clustering technique for the minimum cost design of a naturally clustered computer communication network, in: Proceedings IEEE Conference (TENCON) on Computers, Communication and Automation, Beijing, 1993.","DOI":"10.1109\/TENCON.1993.320030"},{"key":"10.1016\/S0140-3664(97)00043-1_BIB7","doi-asserted-by":"crossref","unstructured":"B. Gavish, S.L. Hantler, An algorithm for optimal route selection in SNA networks, IEEE Trans. on Communication COM-31 (10) (1983) 1151\u20131160.","DOI":"10.1109\/TCOM.1983.1095752"},{"key":"10.1016\/S0140-3664(97)00043-1_BIB8","unstructured":"B.T. Poljack, A general method of solving extremum problem, Soviet Math. Doklady 8 (1967) 593\u2013597."},{"key":"10.1016\/S0140-3664(97)00043-1_BIB9","doi-asserted-by":"crossref","unstructured":"M. Held, R.M. Karp, The travelling salesman problem and minimum spanning trees, Part II, Math. Program. 1 (1971) 6\u201325.","DOI":"10.1007\/BF01584070"},{"key":"10.1016\/S0140-3664(97)00043-1_BIB10","doi-asserted-by":"crossref","unstructured":"M. Held, P. Wolfe, H. Crowder, Validation of subgradient optimization, Math. Program. 6 (1974) 62\u201388.","DOI":"10.1007\/BF01580223"},{"key":"10.1016\/S0140-3664(97)00043-1_BIB11","doi-asserted-by":"crossref","unstructured":"A.M. Geoffrion, Lagrangean relaxation and its uses in integer programming, Math. Program. Study 2 (1974) 82\u2013114.","DOI":"10.1007\/BFb0120690"},{"key":"10.1016\/S0140-3664(97)00043-1_BIB12","unstructured":"A. Mukherjee, B.B. Bhaumik, A.K. Bandyopadhyay, An energy function approach and its application to a new clustering algorithm, in: Proceedings of IEEE Conference (TENCON) on Computers, Communication and Automation, Beijing, 1993."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497000431?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497000431?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T23:24:21Z","timestamp":1555197861000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366497000431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S0140366497000431"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(97)00043-1","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}