On the strength of recursive McCormick relaxations for binary polynomial optimization
Aida Khajavirad
| Year of publication: |
2023
|
|---|---|
| Authors: | Khajavirad, Aida |
| Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 51.2023, 2, p. 146-152
|
| Subject: | Binary polynomial optimization | Cutting planes | Extended flower relaxation | Multilinear polytope | Recursive McCormick relaxations | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.orl.2023.01.009 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10014311840