Unconstrained 0-1 polynomial optimization through convex quadratic reformulation

Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation

A polynomial case of unconstrained zero-one quadratic optimization

Quadratic convex reformulations for quadratic 0–1 programming

Computing Local Optima in Quadratic Unconstrained Binary Optimization Problems in Randomized Polynomial Time

Quadratic Convex Reformulations for Integer and Mixed-Integer Quadratic Programs

Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint