A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems.
Marianna De SantisSven de VriesMartin SchmidtLukas WinkelPublished in: INFORMS J. Comput. (2022)
Keyphrases
- branch and bound method
- linear complementarity problem
- branch and bound
- lower bound
- branch and bound algorithm
- mixed integer programming
- reduce the search space
- optimal configuration
- sufficient conditions
- feasible solution
- interior point
- variational inequalities
- linear programming
- objective function
- combinatorial optimization
- column generation
- semidefinite
- optimal solution
- linear program
- genetic algorithm
- lagrangian relaxation
- upper bound
- state space
- search space