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

From MaRDI portal

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

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Enhancing_RLT-based_relaxations_for_polynomial_programming_problems_via_a_new_class_of_%5C(v%5C)-semidefinite_cuts&oldid=62063283"