The Running Intersection Relaxation of the Multilinear Polytope

DOI10.1287/moor.2021.1121OpenAlexW3153097307MaRDI QIDQ4958553

Aida Khajavirad, Alberto Del Pia

Publication date: 14 September 2021

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2021.1121

zbMATH Keywords

extended formulationshypergraph acyclicitypolyhedral relaxationsrunning intersection propertymultilinear polytope

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items (8)

Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization ⋮ Complexity of optimizing over the integers ⋮ On optimization problems in acyclic hypergraphs ⋮ 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 ⋮ Multilinear sets with two monomials and cardinality constraints

Uses Software

• BARON
• GloMIQO

Cites Work

• Concave extensions for nonlinear 0-1 maximization problems
• Generalized laminar families and certain forbidden matrices
• Extended formulation for CSP that is compact for instances of bounded treewidth
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Experiments in quadratic 0-1 programming
• Disjunctive programming: Properties of the convex hull of feasible points
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
• A hybrid LP/NLP paradigm for global optimization relaxations
• On decomposability of multilinear sets
• A class of valid inequalities for multilinear 0-1 optimization problems
• Berge-acyclic multilinear 0-1 optimization problems
• On the impact of running intersection inequalities for globally solving polynomial optimization problems
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
• On the Desirability of Acyclic Database Schemes
• Degrees of acyclicity for hypergraphs and relational database schemes
• Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
• A class of logic problems solvable by linear programming
• The Multilinear Polytope for Acyclic Hypergraphs
• LP Formulations for Polynomial Optimization Problems
• A Polyhedral Study of Binary Polynomial Programs
• Geometry of cuts and metrics
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Running Intersection Relaxation of the Multilinear Polytope