{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T09:10:35Z","timestamp":1663837835114},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,5,14]],"date-time":"2013-05-14T00:00:00Z","timestamp":1368489600000},"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":[[2014,3]]},"DOI":"10.1007\/s11590-013-0647-0","type":"journal-article","created":{"date-parts":[[2013,5,13]],"date-time":"2013-05-13T07:24:26Z","timestamp":1368429866000},"page":"811-822","source":"Crossref","is-referenced-by-count":9,"title":["Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints"],"prefix":"10.1007","volume":"8","author":[{"given":"Lijie","family":"Bai","sequence":"first","affiliation":[]},{"given":"John E.","family":"Mitchell","sequence":"additional","affiliation":[]},{"given":"Jong-Shi","family":"Pang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,14]]},"reference":[{"key":"647_CR1","unstructured":"Billionnet, A., Elloumi, E. Lambert, A.: Extending the QCR method to general mixed-integer programs. Math. Program. Ser. B 131, 381\u2013401 (2012). doi: 1.1007\/s10107-010-038-7"},{"key":"647_CR2","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1016\/j.dam.2007.12.007","volume":"157","author":"A Billionnet","year":"2009","unstructured":"Billionnet, A., Elloumi, E., Plateau, M.: Improving the performance of standard solvers for quadratic 0\u20131 programs by a tight convex reformulation: The QCR method. Dis. Appl. Math. 157, 1185\u20131197 (2009)","journal-title":"Dis. Appl. Math."},{"key":"647_CR3","doi-asserted-by":"crossref","unstructured":"Bai, L., Mitchell, J.E. , Pang, J.S.: On convex quadratic programs with linear complementarity constraints. Comput. Opt. Appl. 54, 517\u2013554 (2013). doi: 10.1007\/s10589-012-9497-4","DOI":"10.1007\/s10589-012-9497-4"},{"key":"647_CR4","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1287\/opre.1060.0286","volume":"54","author":"G Codato","year":"2006","unstructured":"Codato, G., Fischetti, M.: Combinatorial Benders\u2019 cuts for mixed-integer linear programming. Oper. Res. 54, 738\u2013766 (2006)","journal-title":"Oper. Res."},{"key":"647_CR5","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1023\/A:1008282830093","volume":"10","author":"T Fujie","year":"1997","unstructured":"Fujie, T., Kojima, M.: Semidefinite programming relaxation for nonconvex quadratic programs. J. Global Opt. 10, 367\u2013380 (1997)","journal-title":"J. Global Opt."},{"key":"647_CR6","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1137\/07068463x","volume":"19","author":"J Hu","year":"2008","unstructured":"Hu, J., Mitchell, J.E., Pang, J.S., Bennett, K.P., Kunapuli, G.: On the global resolution of linear programs with linear complementarity constraints. SIAM J. Opt. 19, 445\u2013471 (2008)","journal-title":"SIAM J. Opt."},{"issue":"1","key":"647_CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10898-010-9644-3","volume":"53","author":"J Hu","year":"2012","unstructured":"Hu, J., Mitchell, J.E., Pang, J.S., Yu, B.: On linear programs with linear complementarity constraints. J. Global Opt. 53(1), 29\u201351 (2012)","journal-title":"J. Global Opt."},{"issue":"1\u20132","key":"647_CR8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10107-010-0426-y","volume":"133","author":"J Hu","year":"2012","unstructured":"Hu, J., Mitchell, J.E., Pang, J.S.: An LPCC approach to nonconvex quadratic programs. Math. Program. 133(1\u20132), 243\u2013277 (2012)","journal-title":"Math. Program."},{"key":"647_CR9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1023\/A:1008696504163","volume":"13","author":"H Jiang","year":"1999","unstructured":"Jiang, H., Ralph, D.: QPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints. Comput. Opt. Appl. 13, 25\u201359 (1999)","journal-title":"Comput. Opt. Appl."},{"key":"647_CR10","unstructured":"Galli, L., Letchford, A.N.: Extending the QCR method to mixed-integer quadratically constrained programs. Submitted to Math. Program. (2012)"},{"key":"647_CR11","unstructured":"Lemar\u00e9chal, C., Oustry, F.: Semidefinite relaxations and Lagrangian duality with application to combinatorial optimization. Technical Report RR-3710, INRIA Rhone-Alpes, ZIRST - 655 avenue de l\u2019Europe F-38330 Montbonnot Saint-Martin, France, June (1999)"},{"key":"647_CR12","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal, C., Oustry, F.: SDP relaxations in combinatorial optimization from a Lagrangian viewpoint. In: Hadjisavvas N, Pardalos P.M., (eds.) Advances in Convex Analysis and Global Optimization, chapter 6, vol. 54, pp. 119\u2013134. Springer, Berlin (2001)","DOI":"10.1007\/978-1-4613-0279-7_6"},{"key":"647_CR13","volume-title":"Mathematical Programs with Equilibrium Constraints","author":"ZQ Luo","year":"1996","unstructured":"Luo, Z.Q., Pang, J.S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, New York (1996)"},{"key":"647_CR14","doi-asserted-by":"crossref","unstructured":"Mitchell, J.E., Pang, J.S., Yu, B.: Obtaining tighter relaxations of mathematical programs with complementarity constraints. In: Modeling and Optimization: Theory and Applications, Proceedings in mathematics and statistics. vol. 21, Springer, Berlin (2012)","DOI":"10.1007\/978-1-4614-3924-0_1"},{"key":"647_CR15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"S Poljak","year":"1995","unstructured":"Poljak, S., Rendl, F., Wolkowicz, H.: A recipe for semidefinite relaxation for (0,1)-quadratic programming. J. Global Opt. 7, 51\u201373 (1995)","journal-title":"J. Global Opt."},{"key":"647_CR16","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s10107-010-0395-1","volume":"125","author":"JS Pang","year":"2010","unstructured":"Pang, J.S.: Three modeling paradigms in mathematical programming. Math. Program. Ser. B 125, 297\u2013323 (2010)","journal-title":"Math. Program. Ser. B"},{"key":"647_CR17","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., Tutuncu, R.H.: SDPT3\u2013a Matlab software package for semidefinite programming. Opt. Meth. Softw. 11, 545\u2013581 (1999)","journal-title":"Opt. Meth. Softw."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0647-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-013-0647-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0647-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:36Z","timestamp":1559409096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-013-0647-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,14]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["647"],"URL":"https:\/\/doi.org\/10.1007\/s11590-013-0647-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,14]]}}}