{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T23:56:59Z","timestamp":1772668619913,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T00:00:00Z","timestamp":1588896000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T00:00:00Z","timestamp":1588896000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1334639"],"award-info":[{"award-number":["CMMI-1334639"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1334639"],"award-info":[{"award-number":["CMMI-1334639"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1334327"],"award-info":[{"award-number":["CMMI-1334327"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1736326"],"award-info":[{"award-number":["DMS-1736326"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1402052"],"award-info":[{"award-number":["CMMI-1402052"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"crossref","award":["FA9550-15-1-0126"],"award-info":[{"award-number":["FA9550-15-1-0126"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002848","name":"Comisi\u00f3gn Nacional de Investigaci\u00f3gn Cient\u00edgfica y Tecnol\u00f3gica","doi-asserted-by":"publisher","award":["72140466"],"award-info":[{"award-number":["72140466"]}],"id":[{"id":"10.13039\/501100002848","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10898-020-00905-z","type":"journal-article","created":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T04:51:35Z","timestamp":1588913495000},"page":"687-714","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An enhanced logical benders approach for linear programs with complementarity constraints"],"prefix":"10.1007","volume":"77","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3381-3078","authenticated-orcid":false,"given":"Francisco","family":"Jara-Moroni","sequence":"first","affiliation":[]},{"given":"John E.","family":"Mitchell","sequence":"additional","affiliation":[]},{"given":"Jong-Shi","family":"Pang","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"W\u00e4chter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,8]]},"reference":[{"key":"905_CR1","unstructured":"Achterberg, T.: Constraint integer programming. Ph.D. Thesis, Technische University Berlin (2007)"},{"issue":"1","key":"905_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/ijoc.2016.0723","volume":"29","author":"AM Alvarez","year":"2017","unstructured":"Alvarez, A.M., Louveaux, Q., Wehenkel, L.: A machine learning-based approximation of strong branching. INFORMS J. Comput. 29(1), 185\u2013195 (2017)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"905_CR3","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10589-012-9497-4","volume":"54","author":"L Bai","year":"2013","unstructured":"Bai, L., Mitchell, J.E., Pang, J.S.: On convex quadratic programs with linear complementarity constraints. Comput. Optim. Appl. 54(3), 517\u2013554 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"905_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0911017","volume":"11","author":"JF Bard","year":"1990","unstructured":"Bard, J.F., Moore, J.T.: A branch and bound algorithm for the bilevel programming problem. SIAM J. Sci. Stat. Comput. 11(2), 281\u2013292 (1990)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"3","key":"905_CR5","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-016-9847-8","volume":"65","author":"P Belotti","year":"2016","unstructured":"Belotti, P., Bonami, P., Fischetti, M., Lodi, A., Monaci, M., Nogales-Gomez, A., Salvagnin, D.: On handling indicator constraints in mixed integer programming. Comput. Optim. Appl. 65(3), 545\u2013566 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"905_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10107-015-0891-4","volume":"151","author":"P Bonami","year":"2015","unstructured":"Bonami, P., Lodi, A., Tramontani, A., Wiese, S.: On mathematical programming with indicator constraints. Math. Program. 151, 191\u2013223 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"905_CR7","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/140978077","volume":"26","author":"OP Burdakov","year":"2016","unstructured":"Burdakov, O.P., Kanzow, C., Schwartz, A.: Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method. SIAM J. Optim. 26(1), 397\u2013425 (2016)","journal-title":"SIAM J. Optim."},{"issue":"5\u20136","key":"905_CR8","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Candes","year":"2008","unstructured":"Candes, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted $$\\ell _1$$ minimization. J. Fourier Anal. Appl. 14(5\u20136), 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"2","key":"905_CR9","first-page":"273","volume":"14","author":"M Feng","year":"2018","unstructured":"Feng, M., Mitchell, J.E., Pang, J.S., Shen, X., W\u00e4chter, A.: Complementarity formulations of $$\\ell _0$$-norm optimization problems. Pac. J. Optim. 14(2), 273\u2013305 (2018)","journal-title":"Pac. J. Optim."},{"issue":"1","key":"905_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s12532-017-0122-5","volume":"10","author":"T Fischer","year":"2018","unstructured":"Fischer, T., Pfetsch, M.E.: Branch-and-cut for linear programs with overlapping SOS1 constraints. Math. Program. Comput. 10(1), 33\u201368 (2018)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"905_CR11","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1287\/ijoc.1120.0531","volume":"25","author":"M Fischetti","year":"2013","unstructured":"Fischetti, M., Monaci, M.: Backdoor branching. INFORMS J. Comput. 25(4), 693\u2013700 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"905_CR12","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1287\/opre.2013.1231","volume":"62","author":"M Fischetti","year":"2014","unstructured":"Fischetti, M., Monaci, M.: Exploiting erraticism in search. Oper. Res. 62(1), 114\u2013122 (2014)","journal-title":"Oper. Res."},{"issue":"1","key":"905_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1080\/10556780410001654241","volume":"19","author":"R Fletcher","year":"2004","unstructured":"Fletcher, R., Leyffer, S.: Solving mathematical programs with complementarity constraints as nonlinear programs. Optim. Methods Softw. 19(1), 15\u201340 (2004)","journal-title":"Optim. Methods Softw."},{"key":"905_CR14","doi-asserted-by":"crossref","unstructured":"Gomes, C.P., Kautz, H., Sabharwal, A., Selman, B.: Satisfiability solvers. In: van Harmelen, F., Lifschitz, V., Porter, B. (eds.) Handbook of Knowledge Representation, Elsevier, pp. 89\u2013134 (2008)","DOI":"10.1016\/S1574-6526(07)03002-7"},{"key":"905_CR15","unstructured":"Gomes, C.P., Selman, B., Kautz, H.A.: Boosting combinatorial search through randomization. In: Proceedings of AAAI\/IAAI 1998, p. online. AAAI (1998)"},{"key":"905_CR16","unstructured":"Gurobi Optimization: Inc.: Gurobi optimizer reference manual, 2015. URL: http:\/\/www.gurobi. com (2014)"},{"issue":"1","key":"905_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"JN Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Math. Program. 96(1), 33\u201360 (2003)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"905_CR18","doi-asserted-by":"publisher","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."},{"issue":"1","key":"905_CR19","doi-asserted-by":"publisher","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 solution of linear programs with linear complementarity constraints. SIAM J. Optim. 19(1), 445\u2013471 (2008)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"905_CR20","doi-asserted-by":"publisher","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. Glob. Optim. 53(1), 29\u201351 (2012)","journal-title":"J. Glob. Optim."},{"key":"905_CR21","unstructured":"Huang, J.: The effect of restarts on the efficiency of clause learning. In: Proceedings of IJCAI-07, pp. 2318\u20132323 (2007)"},{"issue":"6","key":"905_CR22","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1287\/opre.19.6.1523","volume":"19","author":"T Ibaraki","year":"1971","unstructured":"Ibaraki, T.: Complementary programming. Oper. Res. 19(6), 1523\u20131529 (1971)","journal-title":"Oper. Res."},{"issue":"1","key":"905_CR23","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1287\/opre.21.1.353","volume":"21","author":"T Ibaraki","year":"1973","unstructured":"Ibaraki, T.: The use of cuts in complementary programming. Oper. Res. 21(1), 353\u2013359 (1973)","journal-title":"Oper. Res."},{"key":"905_CR24","unstructured":"IBM ILOG: Cplex. Book 12.2 User\u2019s Manual (2010)"},{"issue":"1","key":"905_CR25","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0316005","volume":"16","author":"RG Jeroslow","year":"1978","unstructured":"Jeroslow, R.G.: Cutting-planes for complementarity constraints. SIAM J. Control Optim. 16(1), 56\u201362 (1978)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"905_CR26","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01586088","volume":"32","author":"RG Jeroslow","year":"1985","unstructured":"Jeroslow, R.G.: The polynomial hierarchy and a simple model for competitive analysis. Math. Program. 32(2), 146\u2013164 (1985)","journal-title":"Math. Program."},{"issue":"4","key":"905_CR27","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s12532-009-0009-1","volume":"1","author":"FK Karzan","year":"2009","unstructured":"Karzan, F.K., Nemhauser, G.L., Savelsbergh, M.W.: Information-based branching schemes for binary linear mixed integer problems. Math. Program. Comput. 1(4), 249\u2013293 (2009)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"905_CR28","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1137\/040621065","volume":"17","author":"S Leyffer","year":"2006","unstructured":"Leyffer, S., L\u00f3pez-Calva, G., Nocedal, J.: Interior methods for mathematical programs with complementarity constraints. SIAM J. Optim. 17(1), 52\u201377 (2006)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"905_CR29","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11750-017-0451-6","volume":"25","author":"A Lodi","year":"2017","unstructured":"Lodi, A., Zarpellon, G.: On learning and branching: a survey. TOP 25(2), 207\u2013236 (2017)","journal-title":"TOP"},{"key":"905_CR30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511983658","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, Cambridge (1996)"},{"key":"905_CR31","unstructured":"Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: Proceedings of IJCAI-2003, pp. 1173\u20131178 (2003)"},{"key":"905_CR32","unstructured":"Yu, B.: A branch and cut approach to linear programs with linear complementarity constraints. Ph.D. Thesis, Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY 12180 USA (2011)"},{"key":"905_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-018-0149-2","author":"B Yu","year":"2018","unstructured":"Yu, B., Mitchell, J.E., Pang, J.S.: Solving linear programs with complementarity constraints using branch-and-cut. Math. Program. Comput. (2018). https:\/\/doi.org\/10.1007\/s12532-018-0149-2","journal-title":"Math. Program. Comput."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00905-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-020-00905-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00905-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T00:19:30Z","timestamp":1620433170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-020-00905-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,8]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["905"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00905-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,8]]},"assertion":[{"value":"13 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}