0-1 multilinear programming as a unifying theory for LAD pattern generation

Kedong Yan, Hong Seo Ryoo

Research output: Contribution to journalArticlepeer-review

15 Citations (Scopus)


This paper revisits the Boolean logical requirement of a pattern and develops 0-1 multilinear programming (MP) models for (Pareto-)optimal patterns for logical analysis of data (LAD). We show that all existing and also new pattern generation models can naturally be obtained from the MP models via linearization techniques for 0-1 multilinear functions. Furthermore, 0-1 MP provides an insight for understanding how different and independently developed models for a particular type of pattern are inter-related. These show that 0-1 MP presents a unifying theory for pattern generation in LAD.

Original languageEnglish
Pages (from-to)21-39
Number of pages19
JournalDiscrete Applied Mathematics
Publication statusPublished - 2017 Feb 19

Bibliographical note

Funding Information:
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (Grant Number: NRF-2013R1A1A2011784 ).

Publisher Copyright:
© 2016 Elsevier B.V.


  • 0-1 linearization
  • Boolean logic
  • Logical analysis of data
  • Multilinear programming
  • Pattern generation

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of '0-1 multilinear programming as a unifying theory for LAD pattern generation'. Together they form a unique fingerprint.

Cite this