{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T06:20:08Z","timestamp":1778739608926,"version":"3.51.4"},"reference-count":44,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6311,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1989,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In satellite communications networks, distinctive facilities called homing stations perform special transmission functions. Local demand nodes clustered around each homing station communicate with each other via a local switch at the homing station; demand nodes in different cluster communicate with each other via satellite earth stations at the homing stations. Designing such a communication network requires choices on the locations of the earth stations and on the assignments of demand nodes to the local clusters at the earth stations. We formulate this problem as a zero\u2010one quadratic facility location problem and transform it into an equivalent zero\u2010one integer linear program. Computational experience on real data shows that a branch and bound procedure is effective in solving problems with up to 40 demand nodes (major cities) and that the solutions that this algorithm finds improve considerably upon management generated solutions. We also show that a greedy add heuristic, as implemented on an IBM PC, consistently generates optimal or near\u2010optimal solutions.<\/jats:p>","DOI":"10.1002\/net.3230190404","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T03:18:42Z","timestamp":1178939922000},"page":"427-450","source":"Crossref","is-referenced-by-count":33,"title":["Designing satellite communication networks by zero\u2014one quadratic programming"],"prefix":"10.1002","volume":"19","author":[{"given":"Marcia P.","family":"Helme","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas L.","family":"Magnanti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.23.6.585"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2607(80)90017-5"},{"key":"e_1_2_1_4_2","unstructured":"A.BalakrishnanandS. C.Graves A composite algorithm for a concave\u2010cost network flow problem. WP#1669\u201385 Sloan School of Management M.I.T. Cambridge MA (1985) to appear inNetworks."},{"key":"e_1_2_1_5_2","volume-title":"On Benders decomposition and a plant location problem. ARO\u201027","author":"Balinski M.","year":"1963"},{"key":"e_1_2_1_6_2","first-page":"78","article-title":"Sharp lower bound and efficient algorithms for the simple plant location problem","volume":"1","author":"Bilde O.","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(80)90037-5"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093708"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(83)90179-0"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.23.8.789"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.31.5.803"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800160306"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.3.361"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.6.992"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582246"},{"key":"e_1_2_1_16_2","volume-title":"Discrete Location Theory","author":"Francis R."},{"key":"e_1_2_1_17_2","volume-title":"Facility Layout and Locations: An Analytic Approach","author":"Francis R.","year":"1974"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120402"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588244"},{"key":"e_1_2_1_20_2","volume-title":"Location on Networks: Theory and Algorithms","author":"Handler G. Y.","year":"1979"},{"key":"e_1_2_1_21_2","unstructured":"M. P.HelmeandT. L.Magnanti Designing Satellite Communication Networks by Zero\u2010One Quadratic Programming. Working Paper OR 159\u201387 Operations Research Center M.I.T. Cambridge MA (1987)."},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.33.4.803"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130211"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.18.12.B718"},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.9.4.643"},{"key":"e_1_2_1_26_2","unstructured":"B. W.Lamar Y.Sheffi andW. B.Powell Bounding procedures for fixed charge multicommodity network design problems. Working Paper Detp. of Civil Engineering M.I.T. Cambridge MA (1984)."},{"key":"e_1_2_1_27_2","unstructured":"J. M. Y.Leung Polyhedral structure of capacited fixed charge problems and a problem in delivery route planning. Ph.D. Thesis Dept. of Electrical Engineering and Computer Science M.I.T. Cambridge MA (1985)."},{"key":"e_1_2_1_28_2","unstructured":"J. M. Y.Leung T. L.Magnanti andV.Singhal Routing in point\u2010to\u2010point delivery systems. Working Paper OR 174\u201388 Operations Research Center M.I.T. Cambridge MA (1988)."},{"key":"e_1_2_1_29_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.30.5.907"},{"key":"e_1_2_1_30_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.18.1.1"},{"key":"e_1_2_1_31_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.11.2.213"},{"key":"e_1_2_1_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/355972.355976"},{"key":"e_1_2_1_33_2","unstructured":"R.Mendelsohn R. R.Boorstyn andA.Kershenbaum A cutting plane approach to the concentrator location problem. Working Paper (1984)."},{"key":"e_1_2_1_34_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150102"},{"key":"e_1_2_1_35_2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1978.263"},{"key":"e_1_2_1_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(83)90033-4"},{"key":"e_1_2_1_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592026"},{"key":"e_1_2_1_38_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.6.1005"},{"key":"e_1_2_1_39_2","volume-title":"Integer Programming","author":"Salkin H. M.","year":"1975"},{"key":"e_1_2_1_40_2","unstructured":"V.Singhal Point\u2010to\u2010point package delivery systems. M.Sc. Thesis. Operations Research Center M.I.T. Cambridge MA (1984)."},{"key":"e_1_2_1_41_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.1.85"},{"key":"e_1_2_1_42_2","doi-asserted-by":"publisher","DOI":"10.2307\/1235442"},{"key":"e_1_2_1_43_2","volume-title":"Computer Networks","author":"Tanenbaum A. S.","year":"1981"},{"key":"e_1_2_1_44_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.29.4.482"},{"key":"e_1_2_1_45_2","first-page":"127","volume-title":"Combinatorial Optimization: Annotated Bibliographies","author":"Wong R. T.","year":"1985"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230190404","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230190404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T08:44:32Z","timestamp":1697964272000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230190404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,7]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,7]]}},"alternative-id":["10.1002\/net.3230190404"],"URL":"https:\/\/doi.org\/10.1002\/net.3230190404","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,7]]}}}