Index of /videos/courses/optimization-001/05 - Linear Integer Programming

[ICO]NameLast modifiedSizeDescription
[PARENTDIR]Parent Directory  -  
[DIR]11 - MIP 5 - cover cuts, branch and cut, seven bridges, traveling salesman (31-21)/2013-12-16 17:50 -  
[DIR]10 - MIP 4 - convex hull, polyhedral cuts, warehouse location, node packing, graph coloring (19-20)/2013-12-16 17:50 -  
[DIR]09 - MIP 3 - cutting planes, Gomory cuts (20-47)/2013-12-16 17:49 -  
[DIR]08 - MIP 2 - modeling, big-M, warehouse location, graph coloring (28-25)/2013-12-16 17:49 -  
[DIR]07 - MIP 1 - intuition, relaxation, branch and bound, knapsack, warehouse location (26-16)/2013-12-16 17:48 -  
[DIR]06 - LP 6 - duality interpretation and uses (17-00)/2013-12-16 17:47 -  
[DIR]05 - LP 5 - duality derivation (22-00)/2013-12-16 17:47 -  
[DIR]04 - LP 4 - matrix notation, the tableau (20-52)/2013-12-16 17:46 -  
[DIR]03 - LP 3 - the simplex algorithm (32-22)/2013-12-16 17:46 -  
[DIR]02 - LP 2 - algebraic view, naive algorithm (13-42)/2013-12-16 17:45 -  
[DIR]01 - LP 1 - intuition, convexity, geometric view (24-14)/2013-12-16 17:45 -