Strong valid inequalities for Boolean logical pattern generation
From MaRDI portal
Publication:1675646
Recommendations
- Graph, clique and facet of Boolean logical polytope
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
- MILP approach to pattern generation in logical analysis of data
- On Pareto-optimal Boolean logical patterns for numerical data
Cites work
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
- A branch-and-reduce approach to global optimization
- A LAD-based method for selecting short oligo probes for genotyping applications
- Accelerated algorithm for pattern detection in logical analysis of data
- An improved ant colony optimisation heuristic for graph colouring
- An introduction to statistical learning. With applications in R
- Analysis of bounds for multilinear functions
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- Compact MILP models for optimal and Pareto-optimal LAD patterns
- Comprehensive vs. comprehensible classifiers in logical analysis of data
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Coronary risk prediction by logical analysis of data
- Cross-validation:a review2
- Faces for a linear inequality in 0–1 variables
- Facets of the knapsack polytope
- Generalised graph colouring by a hybrid of local search and constraint programming
- Global optimization of multiplicative programs
- scientific article; zbMATH DE number 3152649 (Why is no real title available?)
- scientific article; zbMATH DE number 3400670 (Why is no real title available?)
- scientific article; zbMATH DE number 3103824 (Why is no real title available?)
- Integer Programming
- Logical analysis of Chinese labor productivity patterns
- Logical analysis of numerical data
- L’algebre de Boole et ses applications en recherche operationnelle
- Maximum patterns in datasets
- MILP approach to pattern generation in logical analysis of data
- New methods to color the vertices of a graph
- Nonlinear 0–1 programming: I. Linearization techniques
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- Pareto-optimal patterns in logical analysis of data
- Pattern-based feature selection in genomics and proteomics
- Reducibility among combinatorial problems
- Set partitioning via inclusion-exclusion
- Spanned patterns for the logical analysis of data
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The fundamental limit theorems in probability
- The Predictive Sample Reuse Method with Applications
Cited in
(8)- MILP approach to pattern generation in logical analysis of data
- Spherical classification of data, a new rule-based learning method
- 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
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation
- Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
This page was built for publication: Strong valid inequalities for Boolean logical pattern generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675646)
