Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
From MaRDI portal
Publication:6589749
DOI10.1007/s10107-023-01992-yMaRDI QIDQ6589749
Matthias Walter, Alberto Del Pia
Publication date: 20 August 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A branch and cut solver for the maximum stable set problem
- Primal separation algorithms
- A class of valid inequalities for multilinear 0-1 optimization problems
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- 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
- On the complexity of binary polynomial optimization over acyclic hypergraphs
This page was built for publication: Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
