Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development

From MaRDI portal

(Redirected from Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development)

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=Branch-and-sandwich:_a_deterministic_global_optimization_algorithm_for_optimistic_bilevel_programming_problems._I:_theoretical_development&oldid=62157069"