A polyhedral study of binary polynomial programs
Year of publication: |
May 2017
|
---|---|
Authors: | Del Pia, Alberto ; Khajavirad, Aida |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 42.2017, 2, p. 389-410
|
Subject: | binary polynomial optimization | polyhedral relaxations | multilinear functions | cutting planes | lifting | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
On the strength of recursive McCormick relaxations for binary polynomial optimization
Khajavirad, Aida, (2023)
-
Risk-averse shortest path interdiction
Song, Yongjia, (2016)
-
Lifting of probabilistic cover inequalities
Joung, Seulgi, (2017)
- More ...
-
The running intersection relaxation of the multilinear polytope
Del Pia, Alberto, (2021)
-
Linear programming and community detection
Del Pia, Alberto, (2023)
-
Convex envelopes of products of convex and component-wise concave functions
Khajavirad, Aida, (2012)
- More ...