Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization

DOI10.1007/978-3-031-06901-7_14zbMath1497.90144arXiv2111.04858OpenAlexW4285212989MaRDI QIDQ2164692

Matthias Walter, Alberto Del Pia

Publication date: 16 August 2022

Full work available at URL: https://arxiv.org/abs/2111.04858

zbMATH Keywords

cutting planesseparation algorithmbinary polynomial optimization

Mathematics Subject Classification ID

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

Related Items (1)

Efficient linear reformulations for binary polynomial optimization problems

Cites Work

• A note on two problems in connexion with graphs
• A class of valid inequalities for multilinear 0-1 optimization problems
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• On the impact of running intersection inequalities for globally solving polynomial optimization problems
• L’algebre de Boole et ses applications en recherche operationnelle
• On the ground states of the Bernasconi model
• The Multilinear Polytope for Acyclic Hypergraphs
• On the cut polytope
• The Running Intersection Relaxation of the Multilinear Polytope
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Fibonacci heaps and their uses in improved network optimization algorithms
• A Polyhedral Study of Binary Polynomial Programs
• Geometry of cuts and metrics

This page was built for publication: Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization