Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612)

From MaRDI portal
Revision as of 17:52, 21 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
scientific article

    Statements

    Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (English)
    0 references
    0 references
    0 references
    0 references
    27 September 2012
    0 references

    Identifiers