@inproceedings{19df9adf8a21408cb4cd53edb5abd7b0,
title = "Cliques for Multi-Term Linearization of 0–1 Multilinear Program for Boolean Logical Pattern Generation",
abstract = "0–1 multilinear program (MP) holds a unifying theory to Boolean logical pattern generation. For a tighter polyhedral relaxation of MP, this note exploits cliques in the graph representation of data under analysis to generate valid inequalities for MP that subsume all previous results and, collectively, provide a much stronger relaxation of MP. A preliminary numerical study demonstrates strength and practical benefits of the new results.",
keywords = "0–1 multilinear programming, 0–1 polyhedral relaxation, Clique, Graph, Logical analysis of data, Pattern",
author = "Kedong Yan and Ryoo, {Hong Seo}",
note = "Funding Information: 1This work was supported by National Natural Science Foundation of China (Grant Number: 61806095.) 2Corresponding author. This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (Grant Number: 2017R1D1A1A02018729.) Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.; 6th World Congress on Global Optimization, WCGO 2019 ; Conference date: 08-07-2019 Through 10-07-2019",
year = "2020",
doi = "10.1007/978-3-030-21803-4_38",
language = "English",
isbn = "9783030218027",
series = "Advances in Intelligent Systems and Computing",
publisher = "Springer Verlag",
pages = "376--386",
editor = "{Le Thi}, {Hoai An} and Le, {Hoai Minh} and {Pham Dinh}, Tao",
booktitle = "Optimization of Complex Systems",
}