Strong valid inequalities for Boolean logical pattern generation
From MaRDI portal
Publication:1675646
DOI10.1007/s10898-017-0512-2zbMath1408.90184OpenAlexW2603874477MaRDI QIDQ1675646
Publication date: 2 November 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0512-2
hypercubecliquepatternlogical analysis of dataBoolean logic0-1 linearization0-1 multilinear programming
Related Items
Graph, clique and facet of Boolean logical polytope ⋮ Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches ⋮ 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 ⋮ \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation ⋮ Spherical classification of data, a new rule-based learning method ⋮ Efficient feature selection for logical analysis of large-scale multi-class datasets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compact MILP models for optimal and Pareto-optimal LAD patterns
- \(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
- Logical analysis of numerical data
- Global optimization of multiplicative programs
- Coronary risk prediction by logical analysis of data
- Pareto-optimal patterns in logical analysis of data
- A branch-and-reduce approach to global optimization
- Generalised graph colouring by a hybrid of local search and constraint programming
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- An improved ant colony optimisation heuristic for graph colouring
- Maximum patterns in datasets
- Comprehensive vs. comprehensible classifiers in logical analysis of data
- A LAD-based method for selecting short oligo probes for genotyping applications
- Spanned patterns for the logical analysis of data
- Accelerated algorithm for pattern detection in logical analysis of data
- Integer Programming
- Nonlinear 0–1 programming: I. Linearization techniques
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- Set Partitioning via Inclusion-Exclusion
- L’algebre de Boole et ses applications en recherche operationnelle
- Faces for a linear inequality in 0–1 variables
- Facets of the knapsack polytope
- The Predictive Sample Reuse Method with Applications
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Cross-validation:a review2
- New methods to color the vertices of a graph
- An Introduction to Statistical Learning
- Reducibility among Combinatorial Problems
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The fundamental limit theorems in probability
- Analysis of bounds for multilinear functions
