0-1 multilinear programming as a unifying theory for LAD pattern generation
From MaRDI portal
Publication:730482
DOI10.1016/J.DAM.2016.08.007zbMATH Open1358.90075OpenAlexW2521139169MaRDI QIDQ730482FDOQ730482
Authors: Kedong Yan, Hong Seo Ryoo 
Publication date: 28 December 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.08.007
Recommendations
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation
- Strong valid inequalities for Boolean logical pattern generation
- MILP approach to pattern generation in logical analysis of data
- Compact MILP models for optimal and Pareto-optimal LAD patterns
- Graph, clique and facet of Boolean logical polytope
logical analysis of dataBoolean logicpattern generationmultilinear programming\(0\text{-}1\) linearization
Cites Work
- Faces for a linear inequality in 0–1 variables
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Title not available (Why is that?)
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A convex envelope formula for multilinear functions
- A branch-and-reduce approach to global optimization
- A new column generation algorithm for logical analysis of data
- Analysis of bounds for multilinear functions
- Concave extensions for nonlinear 0-1 maximization problems
- Logical analysis of numerical data
- Pareto-optimal patterns in logical analysis of data
- Maximum patterns in datasets
- Spanned patterns for the logical analysis of data
- L’algebre de Boole et ses applications en recherche operationnelle
- Logical analysis of data -- an overview: from combinatorial optimization to medical applications
- Title not available (Why is that?)
- Data reduction and exact algorithms for clique cover
- Approximations of pseudo-Boolean functions; applications to game theory
- Efficiently covering complex networks with cliques of similar vertices
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- MILP approach to pattern generation in logical analysis of data
- Coronary risk prediction by logical analysis of data
- Comprehensive vs. comprehensible classifiers in logical analysis of data
- Nonlinear 0–1 programming: I. Linearization techniques
- Compact MILP models for optimal and Pareto-optimal LAD patterns
- Logical analysis of Chinese labor productivity patterns
- Strong valid inequalities for Boolean logical pattern generation
- A LAD-based method for selecting short oligo probes for genotyping applications
- Title not available (Why is that?)
- Pattern-based feature selection in genomics and proteomics
Cited In (9)
- MILP approach to pattern generation in logical analysis of data
- Efficient feature selection for logical analysis of large-scale multi-class datasets
- Graph, clique and facet of Boolean logical polytope
- On Pareto-optimal Boolean logical patterns for numerical data
- Integrated optimization model and algorithm for pattern generation and selection in logical analysis of data
- Spherical classification of data, a new rule-based learning method
- Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches
- Strong valid inequalities for Boolean logical pattern generation
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation
Uses Software
This page was built for publication: \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730482)
