{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:52:18Z","timestamp":1720698738102},"reference-count":35,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":8533,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1983,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The problem considered is that of finding an optimal (minimum cost) design for a centralized processing network given a set of locations, traffic magnitudes between these locations, and a single common source or destination. Several heuristics, which are efficient (in terms of their execution time and memory requirements on a digital computer) and which produce seemingly good results, have already been developed and are currently accepted techniques. Some work has also been done on finding optimal solutions to this problem both as a design tool and as a means of verifying the effectiveness of proposed heuristics. We focus on this latter area. Currently known techniques for the optimal solution of this problem via integer programming have fallen short of the desired objectives as they require too much memory and running time to be able to treat problems of realistic size and complexity. We develop an improved technique which is capable of handling more realistic problems.<\/jats:p>","DOI":"10.1002\/net.3230130211","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T15:17:57Z","timestamp":1178896677000},"page":"279-293","source":"Crossref","is-referenced-by-count":45,"title":["Centralized teleprocessing network design"],"prefix":"10.1002","volume":"13","author":[{"given":"Aaron","family":"Kershenbaum","sequence":"first","affiliation":[]},{"given":"Robert R.","family":"Boorstyn","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230060105"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030204"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1972.223452"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1974.1092122"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1147\/sj.53.0142"},{"key":"e_1_2_1_7_2","volume-title":"Complexity of Computer Computations","author":"Fisher M. J.","year":"1972"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1972.8910"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010105"},{"key":"e_1_2_1_11_2","first-page":"137","volume-title":"Perspectives on Optimization","author":"Geoffrion A.","year":"1972"},{"key":"e_1_2_1_12_2","doi-asserted-by":"crossref","unstructured":"E.Johnson On shortest paths and sorting. InProceedings ACM Annual Conference 1972 pp.510\u2013517.","DOI":"10.1145\/800193.569965"},{"key":"e_1_2_1_13_2","unstructured":"M.Karnaugh Multipoint network layout program. IBM Report No. RC3723 (1972)."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040403"},{"key":"e_1_2_1_15_2","unstructured":"A.KershenbaumandR.Boorstyn Centralized teleprocessing network design. InProceedings National Telecommunications Conference 1976."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1974.1092123"},{"key":"e_1_2_1_17_2","doi-asserted-by":"crossref","unstructured":"A.KershenbaumandR.Van Slyke Computing minimum spanning trees efficiently. InProceedings ACM Annual Conference 1972 pp.518\u2013527.","DOI":"10.1145\/800193.569966"},{"key":"e_1_2_1_18_2","unstructured":"S.Krogdehl A combinatorial base for some optimal matroid intersection algorithms. Technical Report SAN\u2010CS\u201074\u2010468 (1974). Stanford University Computer Science Department."},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01681329"},{"key":"e_1_2_1_21_2","unstructured":"E.Lawler Matroids with parity conditions: A new class of combinatorial optimization problems. University of California Berkeley College of Engineering Electronics Research Laboratory Memorandum No. ERL\u2010M334(1971)."},{"key":"e_1_2_1_22_2","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler E.","year":"1976"},{"key":"e_1_2_1_23_2","first-page":"498","article-title":"An effective heuristic algorithm for the traveling salesman problem","volume":"20","author":"Lin S.","year":"1972","journal-title":"Operations Res."},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.6.972"},{"key":"e_1_2_1_25_2","volume-title":"System Analysis for Data Transmission","author":"Martin J.","year":"1972"},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_2_1_27_2","volume-title":"Mathematical Programming","author":"Reinfeld N. V.","year":"1958"},{"key":"e_1_2_1_28_2","volume-title":"Theory of Graphs","author":"Rosenstiehl P.","year":"1967"},{"key":"e_1_2_1_29_2","unstructured":"R. L.SharmaandM. T.El\u2010Bardai Suboptimal communications network synthesis. InProceedings International Conference on Communications 1970 pp.19.11\u201319.16."},{"key":"e_1_2_1_30_2","volume-title":"Introduction to the Theory of Matroids","author":"Tutte W. T.","year":"1971"},{"key":"e_1_2_1_31_2","doi-asserted-by":"publisher","DOI":"10.2307\/2371182"},{"key":"e_1_2_1_32_2","unstructured":"V. K. M.Whitney Comparison of network topology optimization algorithms. InProceedings 1972 ICCC 1972 pp.332\u2013337."},{"key":"e_1_2_1_33_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230080306"},{"key":"e_1_2_1_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1980.1094601"},{"key":"e_1_2_1_35_2","first-page":"996","volume-title":"Proceedings, ICCC 80","author":"Gavish B.","year":"1980"},{"key":"e_1_2_1_36_2","unstructured":"A.Kershenbaum Centralized teleprocessing network design. Ph.D. Thesis Polytechnic Institute of New York (1976)."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230130211","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230130211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T09:16:21Z","timestamp":1697793381000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230130211"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,6]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,6]]}},"alternative-id":["10.1002\/net.3230130211"],"URL":"https:\/\/doi.org\/10.1002\/net.3230130211","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,6]]}}}