Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
From MaRDI portal
Publication:2193002
DOI10.1007/s11590-019-01460-7zbMath1448.90061OpenAlexW2965581393MaRDI QIDQ2193002
Publication date: 24 August 2020
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-019-01460-7
nonlinear optimizationpreprocessingpseudo-Boolean optimizationquadratic unconstrained binary optimizationquadratic reformulationRosenberg quadratization
Related Items (4)
QUBO Software ⋮ Efficient linear reformulations for binary polynomial optimization problems ⋮ Quantum bridge analytics. I: A tutorial on formulating and using QUBO models ⋮ Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Quadratization of symmetric pseudo-Boolean functions
- The unconstrained binary quadratic programming problem: a survey
- Multi-choice goal programming with utility functions
- Quadratic reformulations of nonlinear binary optimization problems
- Pseudo-Boolean optimization
- Mathematical models in marketing. A collection of abstracts. With a preface by M. Beckmann
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
- Embedding equality constraints of optimization problems into a quantum annealer
- Path relinking for unconstrained binary quadratic programming
- Polynomial unconstrained binary optimisation -- part 2
- Compact quadratizations for pseudo-Boolean functions
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
- L’algebre de Boole et ses applications en recherche operationnelle
This page was built for publication: Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
