On linear programming relaxations for solving polynomial programming problems
Evrim Dalkiran, Laleh Ghalami
| Year of publication: |
November 2018
|
|---|---|
| Authors: | Dalkiran, Evrim ; Ghalami, Laleh |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 99.2018, p. 67-77
|
| Subject: | Reformulation-Linearization Technique (RLT) | J-set relaxation | McCormick inequalities | Polynomial programming problems | Linear programming relaxations | Branch-and-bound algorithms | 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.cor.2018.06.010 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011901562