A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation

DOI10.1007/s10898-018-0680-8zbMath1434.90093OpenAlexW2810782686MaRDI QIDQ2274853

Kedong Yan, Hong Seo Ryoo

Publication date: 1 October 2019

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-018-0680-8

zbMATH Keywords

graphfacet-defining inequalitiespatternstarlogical analysis of data0-1 multilinear programmingmulti-term polyhedral relaxation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Boolean programming (90C09)

Related Items (3)

Graph, clique and facet of Boolean logical polytope ⋮ On Pareto-optimal Boolean logical patterns for numerical data ⋮ Efficient feature selection for logical analysis of large-scale multi-class datasets

Uses Software

• UCI-ml
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Concave extensions for nonlinear 0-1 maximization problems
• \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
• Pattern-based feature selection in genomics and proteomics
• MILP approach to pattern generation in logical analysis of data
• Logical analysis of Chinese labor productivity patterns
• A convex envelope formula for multilinear functions
• Logical analysis of numerical data
• Strong valid inequalities for Boolean logical pattern generation
• Coronary risk prediction by logical analysis of data
• A LAD-based method for selecting short oligo probes for genotyping applications
• Accelerated algorithm for pattern detection in logical analysis of data
• Convexification Techniques for Linear Complementarity Constraints
• Nonlinear 0–1 programming: I. Linearization techniques
• Nonlinear 0–1 programming: II. Dominance relations and algorithms
• L’algebre de Boole et ses applications en recherche operationnelle
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Analysis of bounds for multilinear functions

This page was built for publication: A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation