Compact quadratizations for pseudo-Boolean functions
From MaRDI portal
Recommendations
- Quadratization of symmetric pseudo-Boolean functions
- Quadratic reformulations of nonlinear binary optimization problems
- A decomposition method for minimizing quadratic pseudo-Boolean functions
- Minimization of a quadratic pseudo-Boolean function
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
Cites work
- Covering the cube by affine hyperplanes
- Essential covers of the cube by hyperplanes
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 3473554 (Why is no real title available?)
- scientific article; zbMATH DE number 3212646 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- Mixed integer nonlinear programming tools: a practical overview
- Nonlinear integer programming
- Pseudo-Boolean optimization
- Quadratic reformulations of nonlinear binary optimization problems
- Quadratization of symmetric pseudo-Boolean functions
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
Cited in
(18)- A decomposition method for minimizing quadratic pseudo-Boolean functions
- Minimization of a quadratic pseudo-Boolean function
- A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem
- Quadratic sequential computations of Boolean mappings
- Modeling the Costas array problem in QUBO for quantum annealing
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
- Quadratic reformulation of nonlinear pseudo-Boolean functions via the constraint composite graph
- Quadratization of symmetric pseudo-Boolean functions
- QUBO formulations of the longest path problem
- Quadratic reformulations of nonlinear binary optimization problems
- Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions
- Efficient linear reformulations for binary polynomial optimization problems
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- New advances for quantum-inspired optimization
- Reduction-based MAX-3SAT with low nonlinearity and lattices under recombination
- Quantum computing and tensor networks for laminate design: a novel approach to stacking sequence retrieval
- Quadratization and convexification in polynomial binary optimization
- The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
This page was built for publication: Compact quadratizations for pseudo-Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2307493)
