22 marzo - 27 marzo

22 April 2021 - Well solved problems - stream video and slides
Definition of total unimodularity (TU) and sufficient conditions for TU
Minimum cost network flow and its special cases
Shortest path problem
Maximum flow problem
Transportation problem
Assignment problem

23 March 2020 - Branch and bound - stream video and slides
Branch and bound algorithm
Branching and stopping criteria
Lower and upper bounds
An example of the branch and bound algorithm for a two-dimension integer programming problem

25 March 2021 - Branch and Bound (ii) - stream video and slides
An example of the branch and bound algorithm for a binary problem (knapsack problem)
Dantzig's upper bound
Node selection
Stopping criteria

26 March 2021 -  XPress- MP (iii) - stream video
Implementation of
Maximum flow problem (XP 15.1)  .mos file & .dat file
Multi-commodity flow problem (XP 12.3)  .mos file & .dat file
getsize, finalize
arc and path formulations