{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T15:12:43Z","timestamp":1787238763494,"version":"build-2736575974"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-1509666"],"award-info":[{"award-number":["ECCS-1509666"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"UConn Academic Plan Level 1","award":["2806600"],"award-info":[{"award-number":["2806600"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/tase.2018.2835298","type":"journal-article","created":{"date-parts":[[2018,6,15]],"date-time":"2018-06-15T15:35:28Z","timestamp":1529076928000},"page":"531-541","source":"Crossref","is-referenced-by-count":58,"title":["A Scalable Solution Methodology for Mixed-Integer Linear Programming Problems Arising in Automation"],"prefix":"10.1109","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7783-9053","authenticated-orcid":false,"given":"Mikhail A.","family":"Bragin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5158-7388","authenticated-orcid":false,"given":"Peter B.","family":"Luh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0126-5524","authenticated-orcid":false,"given":"Bing","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaorong","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022646725208"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-014-0561-3"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1287\/inte.15.2.10"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.32.4.358"},{"key":"ref31","first-page":"337","article-title":"Generalized gradient methods for non-smooth functions and their applications to mathematical programming problems","volume":"12","author":"shor","year":"1976","journal-title":"Economics Math Methods"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF01073933"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2014.2325860"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2013.2259816"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.25.4.329"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(96)00019-3"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01071403"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/59.41687"},{"key":"ref29","first-page":"593","article-title":"A general method for solving extremal problems","volume":"8","author":"polyak","year":"1967","journal-title":"Sov Math Doklady"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-012-0481-9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2013.2254713"},{"key":"ref20","article-title":"Branch-and-cut","author":"mitchell","year":"2010","journal-title":"Wiley Encyclopedia of Operations Research and Management Science"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/59.317641"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0142-0615(92)90003-R"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2002.805003"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/59.192933"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/59.744490"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2003.820707"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-2012-02598-1"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/PESGM.2014.6939901"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1038\/sj\/jors\/0411109"},{"key":"ref56","author":"luenberger","year":"1984","journal-title":"Linear and Nonlinear Programming"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-008-9183-8"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2017.7510505"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1080\/23307706.2015.1129916"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/PESGM.2015.7286409"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.27.1.1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1033004"},{"key":"ref40","first-page":"1","article-title":"A decomposition and coordination approach for large-scale security constrained unit commitment problems with combined cycle units","author":"sun","year":"2017","journal-title":"Proc IEEE Power Energy Soc Gen Meeting"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.39.6.657"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59408-6_71"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592196"},{"key":"ref15","article-title":"Gomory-Chvátal cutting planes and the elementary closure of polyhedra","author":"eisenbrand","year":"2000"},{"key":"ref16","author":"aliev","year":"2013","journal-title":"Iterated Chvátal–Gomory cuts and the geometry of numbers"},{"key":"ref17","article-title":"An algorithm for the mixed integer problem","author":"gomory","year":"1960"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/010\/0114670"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2307\/1910129"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.883472"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2015.07.027"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.05.013"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2014.05.006"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2015.03.011"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/14095697X"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2005.11.112"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-011-9432-0"},{"key":"ref46","first-page":"41","article-title":"Sur l’approximation, par elements finis d’ordre un, et la resolution, par penalisation-dualite, d’une classe de problems de Dirichlet non lineares","volume":"9","author":"glowinski","year":"1975","journal-title":"Revue Francaise Informat Recherche Operationelle"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(76)90003-1"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1012-8"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/BF00927673"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2018.2808272"},{"key":"ref44","author":"bertsekas","year":"2016","journal-title":"Nonlinear Programming"},{"key":"ref43","article-title":"A method for nonlinear constraints in minimization problems","author":"powell","year":"1969","journal-title":"Optimization"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8856\/8681660\/8386784-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8856\/8681660\/08386784.pdf?arnumber=8386784","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T17:12:47Z","timestamp":1657732367000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8386784\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":57,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tase.2018.2835298","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}