A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation.
Sahar TahernejadTed K. RalphsScott DeNegrePublished in: Math. Program. Comput. (2020)
Keyphrases
- mixed integer
- cost function
- optimal solution
- optimization problems
- np hard
- dynamic programming
- linear programming
- computationally efficient
- learning algorithm
- k means
- expectation maximization
- linear program
- computational complexity
- combinatorial optimization
- totally unimodular
- mixed integer program
- metaheuristic
- probabilistic model
- objective function