An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming
From MaRDI portal
Publication:3009764
DOI10.1007/978-3-642-20807-2_17zbMath1341.90097OpenAlexW1576720100WikidataQ58051147 ScholiaQ58051147MaRDI QIDQ3009764
Miguel F. Anjos, Bissan Ghaddar, Juan Carlos Vera
Publication date: 24 June 2011
Published in: Integer Programming and Combinatoral Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20807-2_17
semidefinite programmingbinary polynomial programmingbinary quadratic programmingvalid inequality generation
Related Items (2)
Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes ⋮ Univariate parameterization for global optimization of mixed-integer polynomial problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semidefinite relaxations of ordering problems
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Semidefinite representations for finite varieties
- Bounds for the quadratic assignment problem using the bundle method
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- The quadratic knapsack problem -- a survey
- Exploiting equalities in polynomial programming
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- Recognizing underlying sparsity in optimization
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
- Exploiting group symmetry in truss topology optimization
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
- Semidefinite programming relaxations for semialgebraic problems
- Sparsity in sums of squares of polynomials
- Symmetry groups, semidefinite programs, and sums of squares
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Minimizing polynomials via sum of squares over the gradient ideal
- Global Optimization with Polynomials and the Problem of Moments
- An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
- Approximation of the Stability Number of a Graph via Copositive Programming
- Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
- Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Class of global minimum bounds of polynomial functions
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- LMI Approximations for Cones of Positive Semidefinite Forms
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A Survey of the S-Lemma
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming
