"No one is harder on a talented person than the person themselves" - Linda Wilkinson ; "Trust your guts and don't follow the herd" ; "Validate direction not destination" ;

May 31, 2021

Branch and Bound for Mixed Integer Solutions

Continuous Variables - Variables can attain any value between lower and upper bound

Discrete - Variables with particular values - Size, Binary, Set of values

Ref - Link1  

Branch-and-Bound (BB) method. – the framework for almost all commercial software for solving
mixed integer linear programs. Basis of all modern MILP codes.

Algo ref


Branch and Cut - Pure cutting plane algorithms. Ineffective for large Mixed Integer Linear Programming.

Ref - Link 2


Notes
If the given problem is a discrete optimization problem, a branch and bound is a good choice.
Branch and bound work efficiently on the combinatory optimization problems

Ref - Link 

Papers

Keep Exploring!!!

No comments: