A convex reformulation and an outer approximation for a large class of binary quadratic programs
Year of publication: |
2023
|
---|---|
Authors: | Rostami, Borzou ; Errico, Fausto ; Lodi, Andrea |
Published in: |
Operations research. - Linthicum, Md. : INFORMS, ISSN 1526-5463, ZDB-ID 2019440-7. - Vol. 71.2023, 2, p. 471-486
|
Subject: | binary quadratic program | convex reformulation | Optimization | outer approximation | variable partitioning constraint | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Mixed-projection conic optimization : a new paradigm for modeling rank constraints
Bertsimas, Dimitris, (2022)
-
A simplified completely positive reformulation for binary quadratic programs
Wang, Qiao, (2023)
-
Using a Conic Bundle method to accelerate both phases of a quadratic convex reformulation
Billionnet, Alain, (2017)
- More ...
-
Rostami, Borzou, (2021)
-
Single allocation hub location with heterogeneous economies of scale
Rostami, Borzou, (2022)
-
Attractiveness factors in retail category space location-allocation problem
Babaee, Sara, (2023)
- More ...