Simple odd -cycle inequalities for binary polynomial optimization
From MaRDI portal
Publication:6589749
DOI10.1007/S10107-023-01992-YMaRDI QIDQ6589749FDOQ6589749
Authors: Alberto Del Pia, Matthias Walter 
Publication date: 20 August 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- A note on two problems in connexion with graphs
- Fibonacci heaps and their uses in improved network optimization algorithms
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- On the cut polytope
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- A branch and cut solver for the maximum stable set problem
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
- Primal separation algorithms
- A class of valid inequalities for multilinear 0-1 optimization problems
- A polyhedral study of binary polynomial programs
- The multilinear polytope for acyclic hypergraphs
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- The Running Intersection Relaxation of the Multilinear Polytope
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- On the ground states of the Bernasconi model
- Title not available (Why is that?)
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589749)
