Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model

From MaRDI portal

(Redirected from Publication:757251)

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=Using_branch-and-bound_to_solve_bi-level_geometric_programming_problems:_A_new_optimization_model&oldid=64107150"