Solver related questions
1 post • Page 1 of 1
Hi everyone, I am solving a large MILP using gams. My instructor asked me to solve the problem using branch and bound method. As for as I know Cplex uses Branch and Cut to solve the MILP. Can anyone help me on how to implement the b&b method in gams?