{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:52:07Z","timestamp":1742943127475,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030218027"},{"type":"electronic","value":"9783030218034"}],"license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-21803-4_38","type":"book-chapter","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T22:03:24Z","timestamp":1560549804000},"page":"376-386","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Cliques for Multi-Term Linearization of 0\u20131 Multilinear Program for Boolean Logical Pattern Generation"],"prefix":"10.1007","author":[{"given":"Kedong","family":"Yan","sequence":"first","affiliation":[]},{"given":"Hong Seo","family":"Ryoo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"key":"38_CR1","unstructured":"IBM Corp.: IBM ILOG CPLEX Optimization Studio CPLEX User\u2019s Manual Version 12 Release 8 (2017). \n                    https:\/\/www.ibm.com\/support\/knowledgecenter\/SSSA5P_12.8.0\/ilog.odms.studio.help\/pdf\/usrcplex.pdf\n                    \n                  . Accessed 12 Dec 2018"},{"key":"38_CR2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01582138","volume":"61","author":"Y Crama","year":"1993","unstructured":"Crama, Y.: Concave extensions for nonlinear 0\u20131 maximization problems. Math. Program. 61, 53\u201360 (1993)","journal-title":"Math. Program."},{"issue":"2","key":"38_CR3","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/moor.2016.0804","volume":"42","author":"A Pia Del","year":"2017","unstructured":"Del Pia, A., Khajavirad, A.: A polyhedral study of binary polynomial programs. Math. Oper. Res. 42(2), 389\u2013410 (2017)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"38_CR4","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1137\/16M1095998","volume":"28","author":"A Pia Del","year":"2018","unstructured":"Del Pia, A., Khajavirad, A.: The multilinear polytope for acyclic hypergraphs. SIAM J. Optim. 28(2), 1049\u20131076 (2018)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"38_CR5","first-page":"5","volume":"1","author":"R Fortet","year":"1959","unstructured":"Fortet, R.: L\u2019alg\u00e8bre de boole dt ses applications en recherche op\u00e9rationnelle. Cahiers du Centre d\u2019\u00c9tudes de Recherche Op\u00e9rationnelle 1(4), 5\u201336 (1959)","journal-title":"Cahiers du Centre d\u2019\u00c9tudes de Recherche Op\u00e9rationnelle"},{"issue":"14","key":"38_CR6","first-page":"17","volume":"4","author":"R Fortet","year":"1960","unstructured":"Fortet, R.: Applications de l\u2019alg\u00e8bre de boole en recherche op\u00e9rationnelle. Revue Fran\u00e7aise d\u2019Informatique et de Recherche Op\u00e9rationnelle 4(14), 17\u201325 (1960)","journal-title":"Revue Fran\u00e7aise d\u2019Informatique et de Recherche Op\u00e9rationnelle"},{"issue":"1","key":"38_CR7","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"12","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. 12(1), 180\u2013182 (1974)","journal-title":"Oper. Res."},{"key":"38_CR8","first-page":"154","volume":"12","author":"F Granot","year":"1971","unstructured":"Granot, F., Hammer, P.: On the use of boolean functions in 0\u20131 programming. Methods Oper. Res. 12, 154\u2013184 (1971)","journal-title":"Methods Oper. Res."},{"key":"38_CR9","unstructured":"Lichman, M.: UCI Machine Learning Repository (2013). \n                    http:\/\/archive.ics.uci.edu\/ml\n                    \n                  . Accessed 12 Dec 2018"},{"key":"38_CR10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"G McCormick","year":"1976","unstructured":"McCormick, G.: Computability of global solutions to factorable nonconvex programs: part I-convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"issue":"1","key":"38_CR11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"JW Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Isr. J. Math. 3(1), 23\u201328 (1965)","journal-title":"Isr. J. Math."},{"key":"38_CR12","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1023\/A:1008217604285","volume":"10","author":"A Rikun","year":"1997","unstructured":"Rikun, A.: A convex envelope formula for multilinear functions. J. Glob. Optim. 10, 425\u2013437 (1997)","journal-title":"J. Glob. Optim."},{"key":"38_CR13","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1016\/j.dam.2008.07.005","volume":"157","author":"HS Ryoo","year":"2009","unstructured":"Ryoo, H.S., Jang, I.Y.: MILP approach to pattern generation in logical analysis of data. Discret. Appl. Math. 157, 749\u2013761 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"38_CR14","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1023\/A:1011295715398","volume":"19","author":"HS Ryoo","year":"2001","unstructured":"Ryoo, H.S., Sahinidis, N.: Analysis of bounds for multilinear functions. J. Glob. Optim. 19(4), 403\u2013424 (2001)","journal-title":"J. Glob. Optim."},{"key":"38_CR15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.dam.2016.08.007","volume":"218","author":"K Yan","year":"2017","unstructured":"Yan, K., Ryoo, H.S.: 0\u20131 multilinear programming as a unifying theory for LAD pattern generation. Discret. Appl. Math. 218, 21\u201339 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"38_CR16","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10898-017-0512-2","volume":"69","author":"K Yan","year":"2017","unstructured":"Yan, K., Ryoo, H.S.: Strong valid inequalities for Boolean logical pattern generation. J. Glob. Optim. 69(1), 183\u2013230 (2017)","journal-title":"J. Glob. Optim."},{"key":"38_CR17","doi-asserted-by":"publisher","unstructured":"Yan, K., Ryoo, H.S.: A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation. J. Glob. Optim. \n                    https:\/\/doi.org\/10.1007\/s10898-018-0680-8\n                    \n                  . (In press)","DOI":"10.1007\/s10898-018-0680-8"}],"container-title":["Advances in Intelligent Systems and Computing","Optimization of Complex Systems: Theory, Models, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21803-4_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T05:42:22Z","timestamp":1572586942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21803-4_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"ISBN":["9783030218027","9783030218034"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21803-4_38","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,6,15]]},"assertion":[{"value":"15 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCGO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Congress on Global Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wcgo2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}