Strong valid inequalities for Boolean logical pattern generation
type: Item
instance of: scholarly article
title: Strong valid inequalities for Boolean logical pattern generation
zbMATH Open document ID: 1408.90184
author: Kedong Yan
author: Hong Seo Ryoo
published in: Journal of Global Optimization
publication date: 2017-11-02T00:00:00Z
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 6802555
zbMATH Keywords: Boolean logic
zbMATH Keywords: logical analysis of data
zbMATH Keywords: pattern
zbMATH Keywords: 0-1 multilinear programming
zbMATH Keywords: 0-1 linearization
zbMATH Keywords: hypercube
zbMATH Keywords: clique
describes a project that uses: BARON
describes a project that uses: ElemStatLearn
describes a project that uses: ISLR
describes a project that uses: UCI-ml
describes a project that uses: Gurobi
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: s10898-017-0512-2
OpenAlex ID: W2603874477
cites work: Comprehensive vs. comprehensible classifiers in logical analysis of data
cites work: Pattern-based feature selection in genomics and proteomics
cites work: Accelerated algorithm for pattern detection in logical analysis of data
cites work: Spanned patterns for the logical analysis of data
cites work: Coronary risk prediction by logical analysis of data
cites work: Facets of the knapsack polytope
cites work: Nonlinear 0–1 programming: I. Linearization techniques
cites work: Nonlinear 0–1 programming: II. Dominance relations and algorithms
cites work: Set Partitioning via Inclusion-Exclusion
cites work: Maximum patterns in datasets
cites work: Logical analysis of numerical data
cites work: New methods to color the vertices of a graph
cites work: Coloring graphs by iterated local search traversing feasible and infeasible solutions
cites work: The fundamental limit theorems in probability
cites work: Integer Programming
cites work: Q5842591
cites work: An improved ant colony optimisation heuristic for graph colouring
cites work: Q3270229
cites work: L’algebre de Boole et ses applications en recherche operationnelle
cites work: The Predictive Sample Reuse Method with Applications
cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
cites work: Q5668612
cites work: Compact MILP models for optimal and Pareto-optimal LAD patterns
cites work: Logical analysis of Chinese labor productivity patterns
cites work: Pareto-optimal patterns in logical analysis of data
cites work: Analysis of bounds for multilinear functions
cites work: An Introduction to Statistical Learning
cites work: Reducibility among Combinatorial Problems
cites work: A LAD-based method for selecting short oligo probes for genotyping applications
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Generalised graph colouring by a hybrid of local search and constraint programming
cites work: MILP approach to pattern generation in logical analysis of data
cites work: A branch-and-reduce approach to global optimization
cites work: Global optimization of multiplicative programs
cites work: Cross-validation:a review2
cites work: Faces for a linear inequality in 0–1 variables
cites work: \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
DOI: 10.1007/S10898-017-0512-2
description: scientific article; zbMATH DE number 6802555