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 | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Mathematik | Mathematics |
-
Using a Conic Bundle method to accelerate both phases of a quadratic convex reformulation
Billionnet, Alain, (2017)
-
On the principle of fermat-lagrange for mixed smooth-convex extremal problems
Brinkhuis, Jan, (1998)
-
Chapter 5: Exponential and logarithmic functions
Todorova, Tamara, (2010)
- More ...
-
Rostami, Borzou, (2021)
-
Single allocation hub location with heterogeneous economies of scale
Rostami, Borzou, (2022)
-
Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
Rostami, Borzou, (2014)
- More ...