Course: Mixed Integer Programming

Topic outline

Mixed Integer Programming Open Course

Collapse all Expand all
- Contributors : Nadia Brauner (UGA, Grenoble), Hadrien Cambazard (Grenoble-INP), Nicolas Catusse (Grenoble-INP)
  Contact : Nadia Brauner
- Vous devez être inscrit dans le cours pour avoir accès à l'éditeur des exercices de programmation (une fois connecté, si vous voyez encore ce message, utilisez la roue dentée en haut à droite).
- One idea, one story: meet the 1962 Procter and Gamble challenge ! Page
  
  View
- Course supports
- Slides MIP in English (N. Brauner) File
- Annonces Forum
Modelling
- OPL User Guide: modelling integer/boolean variables
- Course: Mixed Integer Programming (Modelling tricks) Book
- Skills Modelling
  
  Know the main combinatorial optimization problems and model them as an integer linear program: knapsack, bin packing, set covering, set partitionning, minimum cost flow, shortest path
  
  Self training
- Bin packing Virtual programming lab
  
  Receive a grade
- Know the main modeling techniques
  
  Self training (Shadok)
- C'est le bouquet ! Virtual programming lab
  
  Receive a grade
- Toy shop Virtual programming lab
  
  Receive a grade
- Windscreens wipers Virtual programming lab
  
  Receive a grade
- Coals Virtual programming lab
  
  Receive a grade
- Coals with .dat Virtual programming lab
  
  Receive a grade
- Cars Virtual programming lab
  
  Receive a grade
- OPL User Guide: using .dat files with OPL and the Caseine editor
- Répartition équitable Virtual programming lab
  
  Receive a grade
- Lot sizing (example) Virtual programming lab
  
  Receive a grade
- Dyeing Plant Virtual programming lab
  
  Receive a grade
- Entrepôt pour produits toxiques Virtual programming lab
  
  Receive a grade
- Independent Set (Stable) Virtual programming lab
  
  Receive a grade
- Maximum Matching Virtual programming lab
  
  Receive a grade
- Toys Virtual programming lab
  
  Receive a grade
- Chromatic number Virtual programming lab
  
  Receive a grade
- Matrix Sum (Euler Problem 345) Virtual programming lab
  
  Receive a grade
- Fire stations Virtual programming lab
- One idea, one story: when the salesman started its travel Page
  
  View
- Airline - Compagnie aérienne Virtual programming lab
  
  Receive a grade
Solving
John D.C Little (1928 - ) coins the word "Branch and Bound". He is also known for Little's Law (L = λW).
- Course: Mixed Integer Programming (Solving) Book
- 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
- Vidéo (13min): Mise en oeuvre de l'algorithme de branch and bound Page
- Branch & Bound course test Quiz
  
  Receive a grade
- Branch & bound training Quiz
  
  Receive a grade
- Branch and Bound Training again Quiz
  
  Receive a grade
- Formulation and cuts Book
- Formulations* Quiz
  
  Receive a grade
- Bin packing (without cuts) Virtual programming lab
- Comprendre couplage, transversal et 2-approximation du transversal avec la programmation linéaire en vidéos Page

Topic outline

Mixed Integer Programming Open Course

Modelling

Solving