A simplified completely positive reformulation for binary quadratic programs

DOI10.1016/J.ORL.2023.02.007MaRDI QIDQ6106517zbMATH OpenOpenAlexFDO

Authors

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

binary quadratic programcompletely positivecopositive

Mathematics Subject Classification ID

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

Recommendations

• Structured linear reformulation of binary quadratically constrained quadratic programs
• Simplified semidefinite and completely positive relaxations
• Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis
• Dantzig-Wolfe reformulations for binary quadratic problems
• A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming

Cites work

• A note on Burer's copositive representation of mixed-binary QPs
• An adaptive linear approximation algorithm for copositive programs
• Completely positive and copositive program modelling for quadratic optimization problems
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Simplified semidefinite and completely positive relaxations

Cited in

(4)

• Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches
• Dantzig-Wolfe reformulations for binary quadratic problems
• Publisher's note
• A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6106517)