Examples

Mixed-Integer Optimization

• Solving a knapsack problem with HiGHS
• Solving a facility location problem with a custom branch-and-bound
• Solving a generalized assignment problem by column generation and branch-and-price
• Combining branch-and-price, column generation, and a penalty method for the generalized assignment problem

Bilevel Optimization

• Solving an optimistic LP-LP bilevel problem with KKT reformulation
• Solving an optimistic MILP-MILP bilevel problem with coin-or/MibS
• Solving a pessimistic bilevel problem using an optimistic reformulation

Robust Optimization

• Solving a robust facility location problem by its deterministic equivalent
• Using affine decision rules to solve a two-stage facility location problem with facility disruption
• Using column-and-constraint generation to solve a two-stage facility location problem with facility disruption