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?
Hello,
Why does your instructor want you to solve with branch & bound?
-Steve
Actually I am trying to compare two formulations of the same problem and I need to calculate number of nodes calculated to find the optimal solution. Traditional branch and cut is giving 0 nodes. That’s why I need to use b&b method.
Actually I am trying to compare two formulations of the same problem and I need to calculate number of nodes calculated to find the optimal solution. Traditional branch and cut is giving 0 nodes. That’s why I need to use b&b method.