A class of valid inequalities for multilinear 0-1 optimization problems
From MaRDI portal
Publication:1751230
DOI10.1016/j.disopt.2017.02.001zbMath1387.90125OpenAlexW2358239530MaRDI QIDQ1751230
Elisabeth Rodríguez-Heck, Yves Cramer
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2017.02.001
integer nonlinear programmingpseudo-Boolean optimizationmultilinear binary optimizationstandard linearization
Related Items
Matroid optimisation problems with nested non-linear monomials in the objective function, Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, Error bounds for monomial convexification in polynomial optimization, On the impact of running intersection inequalities for globally solving polynomial optimization problems, 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, A polyhedral study of lifted multicuts, The Convex Hull of a Quadratic Constraint over a Polytope, On the Consistent Path Problem, The Multilinear Polytope for Acyclic Hypergraphs, A new framework to relax composite functions in nonlinear programs, Berge-acyclic multilinear 0-1 optimization problems, The Running Intersection Relaxation of the Multilinear Polytope, 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
Uses Software
Cites Work
- Combinatorial optimization with one quadratic term: spanning trees and forests
- Concave extensions for nonlinear 0-1 maximization problems
- Pseudo-Boolean optimization
- Mixed integer nonlinear programming tools: a practical overview
- Disjunctive programming: Properties of the convex hull of feasible points
- Matroid optimisation problems with nested non-linear monomials in the objective function
- The cut polytope and the Boolean quadric polytope
- Some results on the strength of relaxations of multilinear functions
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- Integer Programming
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
- Nonlinear Integer Programming
- Jointly Constrained Biconvex Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- L’algebre de Boole et ses applications en recherche operationnelle
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- 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
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- A Polyhedral Study of Binary Polynomial Programs
- Analysis of bounds for multilinear functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
