A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation
From MaRDI portal
(Redirected from Publication:2274853)
Recommendations
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
- Strong valid inequalities for Boolean logical pattern generation
- Graph, clique and facet of Boolean logical polytope
- MILP approach to pattern generation in logical analysis of data
- A class of valid inequalities for multilinear 0-1 optimization problems
Cites work
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
- A convex envelope formula for multilinear functions
- A LAD-based method for selecting short oligo probes for genotyping applications
- Accelerated algorithm for pattern detection in logical analysis of data
- Analysis of bounds for multilinear functions
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Concave extensions for nonlinear 0-1 maximization problems
- Convexification techniques for linear complementarity constraints
- Coronary risk prediction by logical analysis of data
- scientific article; zbMATH DE number 3152649 (Why is no real title available?)
- scientific article; zbMATH DE number 3400670 (Why is no real title available?)
- Logical analysis of Chinese labor productivity patterns
- Logical analysis of numerical data
- L’algebre de Boole et ses applications en recherche operationnelle
- MILP approach to pattern generation in logical analysis of data
- Nonlinear 0–1 programming: I. Linearization techniques
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- Pattern-based feature selection in genomics and proteomics
- Strong valid inequalities for Boolean logical pattern generation
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
Cited in
(6)- Strong valid inequalities for Boolean logical pattern generation
- 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
- Answer set programming for pattern generation in logical analysis of data
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
This page was built for publication: A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274853)
