{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T10:56:35Z","timestamp":1782298595011,"version":"3.54.5"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,10,16]],"date-time":"2010-10-16T00:00:00Z","timestamp":1287187200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s11590-010-0249-z","type":"journal-article","created":{"date-parts":[[2010,10,15]],"date-time":"2010-10-15T11:03:10Z","timestamp":1287140590000},"page":"31-41","source":"Crossref","is-referenced-by-count":14,"title":["An improved linearization technique for a class of quadratic 0-1 programming problems"],"prefix":"10.1007","volume":"6","author":[{"given":"Xiaozheng","family":"He","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anthony","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wanpracha A.","family":"Chaovalitwongse","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Henry X.","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,10,16]]},"reference":[{"key":"249_CR1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.orl.2004.05.001","volume":"33","author":"W.P. Adams","year":"2005","unstructured":"Adams W.P., Forrester R.J.: A simple recipe for concise mixed 0-1 linearizations. Operations Research Letters 33, 55\u201361 (2005)","journal-title":"Operations Research Letters"},{"key":"249_CR2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.disopt.2004.03.006","volume":"1","author":"W.P. Adams","year":"2004","unstructured":"Adams W.P., Forrester R.J., Glover F.W.: Comparison and enhancement strategies for linearizing mixed 0-1 quadratic programs. Discrete Optim. 1, 99\u2013120 (2004)","journal-title":"Discrete Optim."},{"key":"249_CR3","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"W.P. Adams","year":"1986","unstructured":"Adams W.P., Sherali H.D.: A tight linearization and an algorithm for zero-one quadratic programming problems. Manag. Sci. 32, 1274\u20131290 (1986)","journal-title":"Manag. Sci."},{"key":"249_CR4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1111\/1467-9787.00134","volume":"39","author":"D.L. Bryan","year":"1999","unstructured":"Bryan D.L., O\u2019Kelly M.E.: Hub-and-spoke network in air transportation: an analytical review. J. Reg. Sci. 39, 275\u2013295 (1999)","journal-title":"J. Reg. Sci."},{"key":"249_CR5","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(94)90318-2","volume":"72","author":"J.F. Campbell","year":"1994","unstructured":"Campbell J.F.: Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72, 387\u2013405 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"249_CR6","first-page":"373","volume-title":"Location theory: applications and theory","author":"J.F. Campbell","year":"2001","unstructured":"Campbell J.F., Ernst A., Krishnamoorthy M.: Hub location problems. In: Hamacher, H., Drezner, Z. (eds) Location theory: applications and theory, pp. 373\u2013406. Springer, New York (2001)"},{"key":"249_CR7","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/j.orl.2004.03.005","volume":"32","author":"W. Chaovalitwongse","year":"2004","unstructured":"Chaovalitwongse W., Pardalos P.M., Prokoyev O.A.: A new linearization technique for multi-quadratic 0-1 programming problems. Oper. Res. Lett. 32, 517\u2013522 (2004)","journal-title":"Oper. Res. Lett."},{"key":"249_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1023\/A:1019236832495","volume":"99","author":"S. Elloumi","year":"2000","unstructured":"Elloumi S., Faye A., Soutif E.: Decomposition and linearization for 0-1 quadratic programming. Ann. Oper. Res. 99, 79\u201393 (2000)","journal-title":"Ann. Oper. Res."},{"key":"249_CR9","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","volume":"4","author":"A.T. Ernst","year":"1996","unstructured":"Ernst A.T., Krishnamoorthy M.: Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat. Sci. 4, 139\u2013154 (1996)","journal-title":"Locat. Sci."},{"key":"249_CR10","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F. Glover","year":"1975","unstructured":"Glover F.: Improved linear integer programming formulations of nonlinear integer programs. Manag. Sci. 22, 455\u2013460 (1975)","journal-title":"Manag. Sci."},{"key":"249_CR11","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/opre.21.1.156","volume":"21","author":"F. Glover","year":"1973","unstructured":"Glover F., Woolsey E.: Further reduction of zero-one polynomial programming problems to zero-one linear programming problems. Oper. Res. 21, 156\u2013161 (1973)","journal-title":"Oper. Res."},{"key":"249_CR12","doi-asserted-by":"crossref","unstructured":"Glover, F., Woolsey, E.: Converting the 0-1 polynomial programming problem to a 0-1 linear program. IRMIS Working paper, 9304, School of Business, Indiana University, Bollomingto, Indiana (1974)","DOI":"10.1287\/opre.22.1.180"},{"key":"249_CR13","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/0377-2217(78)90095-4","volume":"2","author":"L. Kaufman","year":"1978","unstructured":"Kaufman L., Broeckx F.: An algorithm for the quadratic assignmnet problem using benders\u2019 decomposition. Eur. J. Oper. Res. 2, 204\u2013211 (1978)","journal-title":"Eur. J. Oper. Res."},{"key":"249_CR14","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(87)80007-3","volume":"32","author":"M. O\u2019Kelly","year":"1987","unstructured":"O\u2019Kelly M.: A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32, 393\u2013404 (1987)","journal-title":"Eur. J. Oper. Res."},{"key":"249_CR15","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/103147.103156","volume":"17","author":"P.M. Pardalos","year":"1991","unstructured":"Pardalos P.M.: Construction of test problems in quadratic bivalent programming. ACM Trans. Math. Softw. 17, 74\u201387 (1991)","journal-title":"ACM Trans. Math. Softw."},{"key":"249_CR16","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1016\/j.trb.2005.11.003","volume":"40","author":"H.D. Sherali","year":"2006","unstructured":"Sherali H.D., Desai J., Rakha H.: A discrete optimization approach for locating Automatic Vehicle Identification readers for the provision of roadway travel times. Transp. Res. B Methodol. 40, 857\u2013871 (2006)","journal-title":"Transp. Res. B Methodol."},{"key":"249_CR17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11590-006-0019-0","volume":"1","author":"H.D. Sherali","year":"2007","unstructured":"Sherali H.D., Smith J.C.: An improved linearization strategy for zero-one quadratic programming problems. Optim. Lett. 1, 33\u201347 (2007)","journal-title":"Optim. Lett."},{"key":"249_CR18","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/0377-2217(95)00100-X","volume":"94","author":"D. Skorin-Kapov","year":"1996","unstructured":"Skorin-Kapov D., Skorin-Kapov J., O\u2019Kelly M.: Tight linear programming relaxations of uncapacitated p-hub median problems. Eur. J. Oper. Res. 94, 582\u2013593 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"249_CR19","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1287\/opre.15.6.1171","volume":"15","author":"L. Watters","year":"1967","unstructured":"Watters L.: Reduction of integer polynomial programming problems to zero-one linear programming problems. Oper. Res. 15, 1171\u20131174 (1967)","journal-title":"Oper. Res."},{"key":"249_CR20","first-page":"30","volume":"5","author":"W.I. Zangwill","year":"1965","unstructured":"Zangwill W.I.: Media selection by decision programming. J. Advert. Res. 5, 30\u201336 (1965)","journal-title":"J. Advert. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0249-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-010-0249-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0249-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T14:25:00Z","timestamp":1559744700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-010-0249-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,16]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["249"],"URL":"https:\/\/doi.org\/10.1007\/s11590-010-0249-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,16]]}}}