{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:48:52Z","timestamp":1761896932850,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,11,17]],"date-time":"2018-11-17T00:00:00Z","timestamp":1542412800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,11,17]],"date-time":"2018-11-17T00:00:00Z","timestamp":1542412800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-15-1-0223"],"award-info":[{"award-number":["W911NF-15-1-0223"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s11590-018-1361-8","type":"journal-article","created":{"date-parts":[[2018,11,17]],"date-time":"2018-11-17T07:41:36Z","timestamp":1542440496000},"page":"611-636","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Structured linear reformulation of binary quadratically constrained quadratic programs"],"prefix":"10.1007","volume":"14","author":[{"given":"Shan","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Shu-Cherng","family":"Fang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2999-5801","authenticated-orcid":false,"given":"Tiantian","family":"Nie","sequence":"additional","affiliation":[]},{"given":"Qi","family":"An","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,17]]},"reference":[{"issue":"1","key":"1361_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.orl.2004.05.001","volume":"33","author":"WP Adams","year":"2005","unstructured":"Adams, W.P., Forrester, J.R.: A simple recipe for concise mixed 0\u20131 linearizations. Oper. Res. Lett. 33(1), 55\u201361 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"1361_CR2","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.orl.2006.08.008","volume":"35","author":"WP Adams","year":"2007","unstructured":"Adams, W.P., Forrester, J.R.: Linear forms of nonlinear expressions: new insights on old ideas. Oper. Res. Lett. 35(4), 510\u2013518 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"10","key":"1361_CR3","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"WP 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(10), 1274\u20131290 (1986)","journal-title":"Manag. Sci."},{"issue":"6","key":"1361_CR4","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1016\/j.dam.2007.12.007","volume":"157","author":"A Billionnet","year":"2009","unstructured":"Billionnet, A., Elloumi, S., Plateau, M.C.: Improving the performance of standard solvers for quadratic 0\u20131 programs by a tight convex reformulation: the qcr method. Discrete Appl. Math. 157(6), 1185\u20131197 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"1361_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"A Billionnet","year":"2007","unstructured":"Billionnet, A., Elloumi, S.: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0\u20131 problem. Math. Program. 109(1), 55\u201368 (2007)","journal-title":"Math. Program."},{"issue":"1","key":"1361_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10107-015-0921-2","volume":"158","author":"A Billionnet","year":"2016","unstructured":"Billionnet, A., Elloumi, S., Lambert, A.: Exact quadratic convex reformulations of mixed-integer quadratically constrained problems. Math. Program. 158(1), 235\u2013266 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"1361_CR7","first-page":"97","volume":"17","author":"S Burer","year":"2012","unstructured":"Burer, S., Letchford, A.N.: Non-convex mixed-integer nonlinear programming: a survey. Surv. Oper. Res. Manag. Sci. 17(2), 97\u2013106 (2012)","journal-title":"Surv. Oper. Res. Manag. Sci."},{"issue":"1","key":"1361_CR8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.ejor.2016.12.010","volume":"260","author":"S Cafieri","year":"2017","unstructured":"Cafieri, S., Omheni, R.: Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes. Eur. J. Oper. Res. 260(1), 283\u2013290 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"1361_CR9","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.orl.2004.03.005","volume":"32","author":"W Chaovalitwongse","year":"2004","unstructured":"Chaovalitwongse, W., Pardalos, P.M., Prokopyev, O.A.: A new linearization technique for multi-quadratic 0\u20131 programming problems. Oper. Res. Lett. 32(6), 517\u2013522 (2004)","journal-title":"Oper. Res. Lett."},{"key":"1361_CR10","unstructured":"CPLEX User\u2019s MANUAL. IBM ILOG CPLEX Optimization Stutio, Version 12 Release 8. 1987\u20132018"},{"issue":"4","key":"1361_CR11","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1007\/s11590-013-0676-8","volume":"8","author":"L Galli","year":"2014","unstructured":"Galli, L., Letchford, N.A.: A compact variant of the QCR method for quadratically constrained quadratic 0\u20131 programs. Optim. Lett. 8(4), 1213\u20131224 (2014)","journal-title":"Optim. Lett."},{"key":"1361_CR12","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Association for Symbolic Logic, Poughkeepsie (1983)"},{"issue":"3","key":"1361_CR13","first-page":"294","volume":"9","author":"W Gharibi","year":"2012","unstructured":"Gharibi, W., Xia, Y.: A tight linearization strategy for zero-one quadratic programming problems. Int. J. Comput. Sci. Issues 9(3), 294\u2013299 (2012)","journal-title":"Int. J. Comput. Sci. Issues"},{"issue":"4","key":"1361_CR14","doi-asserted-by":"publisher","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 problems. Manag. Sci. 22(4), 455\u2013460 (1975)","journal-title":"Manag. Sci."},{"issue":"1","key":"1361_CR15","doi-asserted-by":"publisher","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(1), 156\u2013161 (1973)","journal-title":"Oper. Res."},{"issue":"1","key":"1361_CR16","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F Glover","year":"1974","unstructured":"Glover, F., Woolsey, E.: Converting the 0\u20131 polynomial programming problem to a 0\u20131 linear program. Oper. Res. 22(1), 180\u2013182 (1974)","journal-title":"Oper. Res."},{"issue":"1","key":"1361_CR17","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger, G., Hao, J.K., Glover, F., Lewis, M., L\u00fc, Z., Wang, H., Wang, Y.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1), 58\u201381 (2014)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"1361_CR18","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola, E.M., de Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657\u2013690 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1361_CR19","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1287\/mnsc.26.3.282","volume":"26","author":"RD McBride","year":"1980","unstructured":"McBride, R.D., Yormark, J.S.: An implicit enumeration algorithm for quadratic integer programming. Manag. Sci. 26(3), 282\u2013296 (1980)","journal-title":"Manag. Sci."},{"issue":"4","key":"1361_CR20","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1080\/10556788.2015.1134528","volume":"31","author":"T Nie","year":"2016","unstructured":"Nie, T., Fang, S.C., Deng, Z., Lavery, J.E.: On linear conic relaxation of discrete quadratic programs. Optim. Methods Softw. 31(4), 737\u2013754 (2016)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1361_CR21","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-004-0529-4","volume":"101","author":"PM Pardalos","year":"2004","unstructured":"Pardalos, P.M., Chaovalitwongse, W., Iasemidis, L.D., Chris Sackellares, J., Shiau, D.S., Carney, P.R., Prokopyev, O.A., Yatsenko, V.A.: Seizure warning algorithm based on optimization and nonlinear dynamics. Math. Program. 101(2), 365\u2013385 (2004)","journal-title":"Math. Program."},{"issue":"5","key":"1361_CR22","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.dam.2006.08.007","volume":"155","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D.: The quadratic knapsack problem\u2014a survey. Discrete Appl. Math. 155(5), 623\u2013648 (2007)","journal-title":"Discrete Appl. Math."},{"key":"1361_CR23","unstructured":"Sahinidis, V.N.: BARON 17.8.9: Global Optimization of Mixed-Integer Nonlinear Programs, User\u2019s Manual (2017)"},{"issue":"1","key":"1361_CR24","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11590-006-0019-0","volume":"1","author":"HD Sherali","year":"2007","unstructured":"Sherali, H.D., Smith, J.C.: An improved linearization strategy for zero-one quadratic programming problems. Optim. Lett. 1(1), 33\u201347 (2007)","journal-title":"Optim. Lett."},{"issue":"6","key":"1361_CR25","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1287\/opre.15.6.1171","volume":"15","author":"LJ Watters","year":"1967","unstructured":"Watters, L.J.: Reduction of integer polynomial programming problems to zero-one linear programming problems. Oper. Res. 15(6), 1171\u20131174 (1967)","journal-title":"Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1361-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-1361-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1361-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T17:49:56Z","timestamp":1589651396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-1361-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,17]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["1361"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-1361-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2018,11,17]]},"assertion":[{"value":"18 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}