New for: D1
In practice, most MILPs are solved by repeatedly restricting the feasible region and solving the corresponding LP relaxations. This presentation provides an overview over an MILP decomposition and a MILP augmentation algorithm which obtain an optimal solution of an MILP without frequently computing LP relaxations.
---------------
Join Zoom Meeting
Meeting ID: 527 278 8807
Note: for people outside D1 interested in listening to this talk, please contact Sándor Kisfaludi-Bak at skisfalu@mpi-inf.mpg.de for the password.