Simple odd -cycle inequalities for binary polynomial optimization

DOI10.1007/S10107-023-01992-YMaRDI QIDQ6589749zbMATH OpenFDO

Authors Alberto Del Pia, Matthias Walter

Publication date 20 August 2024

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10107-023-01992-Y

zbMATH Keywords

binary polynomial optimizationcutting planesseparation algorithm

Mathematics Subject Classification ID

Integer programming (90C10) Polynomial optimization (90C23)

Recommendations

• Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
• scientific article; zbMATH DE number 7525500
• Multilinear sets with two monomials and cardinality constraints
• A polyhedral study of binary polynomial programs
• The multilinear polytope for acyclic hypergraphs

Cites work

• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• A branch and cut solver for the maximum stable set problem
• A class of valid inequalities for multilinear 0-1 optimization problems
• A note on two problems in connexion with graphs
• A polyhedral study of binary polynomial programs
• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
• Fibonacci heaps and their uses in improved network optimization algorithms
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 7525500 (Why is no real title available?)
• On the complexity of binary polynomial optimization over acyclic hypergraphs
• On the cut polytope
• On the ground states of the Bernasconi model
• On the impact of running intersection inequalities for globally solving polynomial optimization problems
• Primal separation algorithms
• Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
• Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• The multilinear polytope for acyclic hypergraphs
• The Running Intersection Relaxation of the Multilinear Polytope

Cited in

(3)

• Quadratization and convexification in polynomial binary optimization
• 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: Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589749)