Graph, clique and facet of Boolean logical polytope
From MaRDI portal
Recommendations
- Strong valid inequalities for Boolean logical pattern generation
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation
- MILP approach to pattern generation in logical analysis of data
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
- On Pareto-optimal Boolean logical patterns for numerical data
Cites work
- scientific article; zbMATH DE number 3152649 (Why is no real title available?)
- scientific article; zbMATH DE number 3400670 (Why is no real title available?)
- A LAD-based method for selecting short oligo probes for genotyping applications
- A convex envelope formula for multilinear functions
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation
- A polyhedral study of binary polynomial programs
- 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
- Coronary risk prediction by logical analysis of data
- Logical analysis of numerical data
- MILP approach to pattern generation in logical analysis of data
- Nonlinear 0–1 programming: I. Linearization techniques
- On Various Algorithms for Estimating the Chromatic Number of a Graph
- On cliques in graphs
- Strong valid inequalities for Boolean logical pattern generation
- Subset-conjunctive rules for breast cancer diagnosis
- Support-vector networks
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The multilinear polytope for acyclic hypergraphs
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
Cited in
(4)- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
- Strong valid inequalities for Boolean logical pattern generation
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation
- Preface to the special issue dedicated to the 6th world congress on global optimization held in Metz, France, July 8--10, 2019
This page was built for publication: Graph, clique and facet of Boolean logical polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124813)
