A class of valid inequalities for multilinear 0-1 optimization problems
From MaRDI portal
Publication:1751230
Recommendations
- Valid inequalities for mixed integer linear programs
- Valid inequalities and convex hulls for multilinear functions
- Optimal solutions to a class of nonconvex minimization problems with linear inequality constraints
- Berge-acyclic multilinear 0-1 optimization problems
- A note on multiple optimality conditions for programs with convex inequality constraints
- On the solvability of a class of parametrized multivariational inequalities
- Optimality for \(E\text{-}[0,1]\) convex multi-objective programming problems
- On a class of multivalued variational inequalities
- \(L_1\) optimization under linear inequality constraints
- On efficient solutions of 0-1 multi-objective linear programming problems
Cites work
- A polyhedral study of binary polynomial programs
- Analysis of bounds for multilinear functions
- Combinatorial optimization with one quadratic term: spanning trees and forests
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Concave extensions for nonlinear 0-1 maximization problems
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 3152649 (Why is no real title available?)
- scientific article; zbMATH DE number 3212646 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- Integer Programming
- Jointly Constrained Biconvex Programming
- L’algebre de Boole et ses applications en recherche operationnelle
- Matroid optimisation problems with nested non-linear monomials in the objective function
- Mixed integer nonlinear programming tools: a practical overview
- Nonlinear integer programming
- Pseudo-Boolean optimization
- Some results on the strength of relaxations of multilinear functions
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The cut polytope and the Boolean quadric polytope
Cited in
(30)- Matroid optimisation problems with nested non-linear monomials in the objective function
- Berge-acyclic multilinear 0-1 optimization problems
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- Matroid optimization problems with monotone monomials in the objective
- Multilinear sets with two monomials and cardinality constraints
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- Cardinality constrained multilinear sets
- A new framework to relax composite functions in nonlinear programs
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation
- Error bounds for monomial convexification in polynomial optimization
- A polyhedral study of lifted multicuts
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- The multilinear polytope for acyclic hypergraphs
- The Running Intersection Relaxation of the Multilinear Polytope
- The convex hull of a quadratic constraint over a polytope
- On the consistent path problem
- On the strength of recursive McCormick relaxations for binary polynomial optimization
- Efficient linear reformulations for binary polynomial optimization problems
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences
- Simple odd -cycle inequalities for binary polynomial optimization
- A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs
- Short paper -- The binary linearization complexity of pseudo-Boolean functions
- Quadratization and convexification in polynomial binary optimization
- On the benefits of a new continuous reformulation for QUBO problems
- Convexifying multilinear sets with cardinality constraints: structural properties, nested case and extensions
- The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
- Extending a continuous RLT-based algorithm to mixed-integer polynomial problems
This page was built for publication: A class of valid inequalities for multilinear 0-1 optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751230)
