Cliques for Multi-Term Linearization of 0–1 Multilinear Program for Boolean Logical Pattern Generation

Kedong Yan, Hong Seo Ryoo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationOptimization of Complex Systems
Subtitle of host publicationTheory, Models, Algorithms and Applications, 2019
EditorsHoai An Le Thi, Hoai Minh Le, Tao Pham Dinh
PublisherSpringer Verlag
Pages376-386
Number of pages11
ISBN (Print)9783030218027
DOIs
Publication statusPublished - 2020 Jan 1
Event6th World Congress on Global Optimization, WCGO 2019 - Metz, France
Duration: 2019 Jul 82019 Jul 10

Publication series

NameAdvances in Intelligent Systems and Computing
Volume991
ISSN (Print)2194-5357

Conference

Conference6th World Congress on Global Optimization, WCGO 2019
CountryFrance
CityMetz
Period19/7/819/7/10

Fingerprint

Linearization

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

Yan, K., & Ryoo, H. S. (2020). Cliques for Multi-Term Linearization of 0–1 Multilinear Program for Boolean Logical Pattern Generation. In H. A. Le Thi, H. M. Le, & T. Pham Dinh (Eds.), Optimization of Complex Systems: Theory, Models, Algorithms and Applications, 2019 (pp. 376-386). (Advances in Intelligent Systems and Computing; Vol. 991). Springer Verlag. https://doi.org/10.1007/978-3-030-21803-4_38

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 proceedingConference contribution

Yan, K & Ryoo, HS 2020, Cliques for Multi-Term Linearization of 0–1 Multilinear Program for Boolean Logical Pattern Generation. in HA Le Thi, HM Le & T Pham Dinh (eds), Optimization of Complex Systems: Theory, Models, Algorithms and Applications, 2019. Advances in Intelligent Systems and Computing, vol. 991, Springer Verlag, pp. 376-386, 6th World Congress on Global Optimization, WCGO 2019, Metz, France, 19/7/8. https://doi.org/10.1007/978-3-030-21803-4_38
Yan K, Ryoo HS. Cliques for Multi-Term Linearization of 0–1 Multilinear Program for Boolean Logical Pattern Generation. In Le Thi HA, Le HM, Pham Dinh T, editors, Optimization of Complex Systems: Theory, Models, Algorithms and Applications, 2019. Springer Verlag. 2020. p. 376-386. (Advances in Intelligent Systems and Computing). https://doi.org/10.1007/978-3-030-21803-4_38
Yan, Kedong ; Ryoo, Hong Seo. / Cliques for Multi-Term Linearization of 0–1 Multilinear Program for Boolean Logical Pattern Generation. Optimization of Complex Systems: Theory, Models, Algorithms and Applications, 2019. editor / Hoai An Le Thi ; Hoai Minh Le ; Tao Pham Dinh. Springer Verlag, 2020. pp. 376-386 (Advances in Intelligent Systems and Computing).
@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}",
year = "2020",
month = "1",
day = "1",
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",

}

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 -