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

1 Citation (Scopus)

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

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)

Fingerprint Dive into the research topics of 'Cliques for Multi-Term Linearization of 0–1 Multilinear Program for Boolean Logical Pattern Generation'. Together they form a unique fingerprint.

Cite this