A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints.
Yohan ShimMarte FodstadSteven A. GabrielAsgeir TomasgardPublished in: Ann. Oper. Res. (2013)
Keyphrases
- branch and bound method
- mathematical programs with equilibrium constraints
- branch and bound
- lower bound
- mixed integer programming
- reduce the search space
- branch and bound algorithm
- optimal configuration
- feasible solution
- optimization problems
- optimal solution
- upper bound
- probability distribution
- search algorithm
- combinatorial optimization
- column generation
- genetic algorithm
- linear programming
- scheduling problem
- np hard
- high dimensional