Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C26 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6236750 / rank
 
Normal rank
Property / zbMATH Keywords
 
reformulation-linearization technique (RLT)
Property / zbMATH Keywords: reformulation-linearization technique (RLT) / rank
 
Normal rank
Property / zbMATH Keywords
 
filtering strategies
Property / zbMATH Keywords: filtering strategies / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial programming
Property / zbMATH Keywords: polynomial programming / rank
 
Normal rank
Property / zbMATH Keywords
 
branch-and-bound
Property / zbMATH Keywords: branch-and-bound / rank
 
Normal rank

Revision as of 12:59, 29 June 2023

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
    0 references
    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

    Identifiers