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.
| Original language | English |
|---|---|
| Title of host publication | Optimization of Complex Systems |
| Subtitle of host publication | Theory, Models, Algorithms and Applications, 2019 |
| Editors | Hoai An Le Thi, Hoai Minh Le, Tao Pham Dinh |
| Publisher | Springer Verlag |
| Pages | 376-386 |
| Number of pages | 11 |
| ISBN (Print) | 9783030218027 |
| DOIs | |
| Publication status | Published - 2020 Jan 1 |
| Event | 6th World Congress on Global Optimization, WCGO 2019 - Metz, France Duration: 2019 Jul 8 → 2019 Jul 10 |
Publication series
| Name | Advances in Intelligent Systems and Computing |
|---|---|
| Volume | 991 |
| ISSN (Print) | 2194-5357 |
Conference
| Conference | 6th World Congress on Global Optimization, WCGO 2019 |
|---|---|
| Country | France |
| City | Metz |
| Period | 19/7/8 → 19/7/10 |
Fingerprint
Keywords
- 0–1 multilinear programming
- 0–1 polyhedral relaxation
- Clique
- Graph
- Logical analysis of data
- Pattern
ASJC Scopus subject areas
- Control and Systems Engineering
- Computer Science(all)
Cite this
Cliques for Multi-Term Linearization of 0–1 Multilinear Program for Boolean Logical Pattern Generation. / Yan, Kedong; Ryoo, Hong Seo.
Optimization of Complex Systems: Theory, Models, Algorithms and Applications, 2019. ed. / Hoai An Le Thi; Hoai Minh Le; Tao Pham Dinh. Springer Verlag, 2020. p. 376-386 (Advances in Intelligent Systems and Computing; Vol. 991).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Cliques for Multi-Term Linearization of 0–1 Multilinear Program for Boolean Logical Pattern Generation
AU - Yan, Kedong
AU - Ryoo, Hong Seo
PY - 2020/1/1
Y1 - 2020/1/1
N2 - 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.
AB - 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.
KW - 0–1 multilinear programming
KW - 0–1 polyhedral relaxation
KW - Clique
KW - Graph
KW - Logical analysis of data
KW - Pattern
UR - http://www.scopus.com/inward/record.url?scp=85068373576&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85068373576&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-21803-4_38
DO - 10.1007/978-3-030-21803-4_38
M3 - Conference contribution
AN - SCOPUS:85068373576
SN - 9783030218027
T3 - Advances in Intelligent Systems and Computing
SP - 376
EP - 386
BT - Optimization of Complex Systems
A2 - Le Thi, Hoai An
A2 - Le, Hoai Minh
A2 - Pham Dinh, Tao
PB - Springer Verlag
ER -