Mixed Integer Linear Program (MILP) question

116 Views Asked by At

I am trying to solve an MILP problem. I was wondering if Branch and Cut/Branch and Bound methods find optimal solution or not? Isn't the complexity exponential? Are there heuristic solvers available? Thanks