A branch-and-cut algorithm for Mixed-Integer Bilinear Programming.
Matteo FischettiMichele MonaciPublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- mixed integer
- computational complexity
- cost function
- learning algorithm
- optimal solution
- np hard
- dynamic programming
- k means
- genetic algorithm
- search space
- computationally efficient
- objective function
- special case
- probabilistic model
- simulated annealing
- expectation maximization
- parameter estimation
- higher dimensional
- linear programming problems