Section: Solving | Mixed Integer Programming

John D.C Little (1928 - ) coins the word "Branch and Bound". He is also known for Little's Law (L = λW).

Select activity Course: Mixed Integer Programming (Solving)

Course: Mixed Integer Programming (Solving) Book
Select activity Know the definition of a linear relaxation Know...

Know the definition of a linear relaxation

Know the relation between the value of an optimal solution of the MIP and of the linear relaxation

Be able to explain the principle of the Branch and Bound algorithm graphically (2 variables)

Know which variable can be branched on and the branching conditions

Know how to calculate the lower and upper bound during the execution of the algorithm

Know the conditions that allow to cut a branch

Self training
Select activity Vidéo (13min): Mise en oeuvre de l'algorithme de branch and bound

Vidéo (13min): Mise en oeuvre de l'algorithme de branch and bound Page
Select activity Branch & Bound course test

Branch & Bound course test Quiz

Students must

Receive a grade
Select activity Branch & bound training

Branch & bound training Quiz

Students must

Receive a grade
Select activity Branch and Bound Training again

Branch and Bound Training again Quiz

Students must

Receive a grade
Select activity Étiquette
Select activity Formulation and cuts

Formulation and cuts Book

Students must

Mark as done
Select activity Formulations*

Formulations* Quiz

Students must

Receive a grade
Select activity Bin packing (without cuts)

Bin packing (without cuts) Virtual programming lab

Students must

Mark as done
Select activity Comprendre couplage, transversal et 2-approximation du transversal avec la programmation linéaire en vidéos

Comprendre couplage, transversal et 2-approximation du transversal avec la programmation linéaire en vidéos Page

Section outline