Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality |
scientific article; zbMATH DE number 6236750
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality |
scientific article; zbMATH DE number 6236750 |
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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8814307
0 references
0.87063533
0 references
0 references
0 references
0 references
0.85935974
0 references
0.8591266
0 references
0.8574024
0 references
