Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: QSopt-Exact / rank | |||
Normal rank | |||
Revision as of 17:36, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality |
scientific article |
Statements
Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (English)
0 references
9 December 2013
0 references
reformulation-linearization technique (RLT)
0 references
filtering strategies
0 references
polynomial programming
0 references
branch-and-bound
0 references
