Branching drection and node selection strategies in B&B algorithm

[Md Abdul Quddus]

Hello,

I start investigating the B & B algorithm. I have got some basic idea through reading some internet sources and some journal papers. I want to dig it more.

I would like to know the details about the branching direction and node selection strategies. Basically I want to know the concept and after understanding the concept,  implement it to the coding.

I will be using python and Gurobi optimizer.

It will be highly appreciated if anyone can provide some links for the materials and videos or sample coding.

Thanks in advanced,

MAQ

[Amal De Silva]

Hi  Abdul,

The following link gives an introduction to the Gurobi Branch and Bound Algorithm.

http://www.gurobi.com/resources/getting-started/mip-basics.

If you want to change the branching direction you can use the following parameter:

https://www.gurobi.com/documentation/6.5/refman/branchdir.html

You can change the node selection strategy using the following parameter:

https://www.gurobi.com/documentation/6.5/refman/varbranch.html


Note the default branching direction and node selection strategy is the best option for vast majority of problems and in general you would not need to change these parameters. Also, Gurobi does not support changing the branching direction or the node selections through callbacks.

I hope this helps

Dr. Amal de Silva
Gurobi Optimization

[Md Abdul Quddus]

Dr. Silva,

Thank you very much. This is exactly what I am looking for. I will go through these link.

Regards,

MAQ