Interface with solvers like Gurobi and HiGHS, or write your own branch-and-bound algorithm.

Solve bilevel problems by KKT reformulations or with bilevel solvers like MibS.

Handle uncertain problems using dualization or column-and-constraint generation algorithms.

Solve large-scale problems efficiently with column generation and branch-and-price techniques.