A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints

From MaRDI portal

(Redirected from A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints)

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=A_new_branch_and_bound_algorithm_for_solving_quadratic_programs_with_linear_complementarity_constraints&oldid=63795351"