A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs

DOI10.1287/opre.2021.2241OpenAlexW4293227094MaRDI QIDQ6192831

Borzou Rostami, Fausto Errico, Andrea Lodi

Publication date: 12 March 2024

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

Full work available at URL: https://doi.org/10.1287/opre.2021.2241

zbMATH Keywords

optimizationouter approximationconvex reformulationbinary quadratic programvariable partitioning constraint

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

This page was built for publication: A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs