A simplified completely positive reformulation for binary quadratic programs

DOI10.1016/j.orl.2023.02.007zbMath1525.90319OpenAlexW4321438667MaRDI QIDQ6106517

No author found.

Publication date: 3 July 2023

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2023.02.007

zbMATH Keywords

completely positivecopositivebinary quadratic program

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20)

Cites Work

• Simplified semidefinite and completely positive relaxations
• A note on Burer's copositive representation of mixed-binary QPs
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Completely positive and copositive program modelling for quadratic optimization problems
• An Adaptive Linear Approximation Algorithm for Copositive Programs

This page was built for publication: A simplified completely positive reformulation for binary quadratic programs