Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming

From MaRDI portal

(Redirected from Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming)

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=Pseudo_basic_steps:_bound_improvement_guarantees_from_Lagrangian_decomposition_in_convex_disjunctive_programming&oldid=72886401"