Videos of playlist "PLUDyUd8CHZbCATbyGRwXLKPa7KiwpXmcj"
14:47 / 1.1 The North-West corner method (Decision 2 - Chapter 1: Transportation problems)
23:10 / 1.2 Unbalanced problems and degenerate solutions (Decision 2 - Chapter 1: Transportation problems)
24:50 / 1.3 Finding an improved solution (Decision 2 - Chapter 1: Transportation problems)
50:52 / 1.4 The stepping-stone method (Decision 2 - Chapter 1: Transportation problems)
9:59 / 1.5 Linear programming (Decision 2 - Chapter 1: Transportation problems)
29:12 / 2.1 The Hungarian algorithm (Decision 2 - Chapter 2: Allocation problems)
5:55 / 2.2 Using a dummy (Decision 2 - Chapter 2: Allocation problems)
8:11 / 2.3 Maximum profit allocation (Decision 2 - Chapter 2: Allocation problems)
15:10 / 2.4 Managing incomplete data (Decision 2 - Chapter 2: Allocation problems)
17:57 / 2.5 Linear programming (Decision 2 - Chapter 2: Allocation problems)
19:07 / 3.1 Flows in networks (Decision 2 - Chapter 3: Flows in networks 1)
9:54 / 3.2 Cuts and their capacities (Decision 2 - Chapter 3: Flows in networks 1)
5:38 / 3.3 Finding an initial flow (Decision 2 - Chapter 3: Flows in networks 1)
33:00 / 3.4 Flow augmenting routes (Decision 2 - Chapter 3: Flows in networks 1)
11:19 / 3.5 Maximum flow minimum cut theorem (Decision 2 - Chapter 3: Flows in networks 1)
22:34 / 4.1 Lower capacities (Decision 2 - Chapter 4: Flows in networks 2)
29:46 / 4.2 Sources and sinks (Decision 2 - Chapter 4: Flows in networks 2)
10:18 / 4.3 Restricted capacity nodes (Decision 2 - Chapter 4: Flows in networks 2)
43:04 / 5.1 Shortest and longest path problems (Decision 2 - Chapter 5: Dynamic programming)
24:40 / 5.2 Minimax and maximin problems (Decision 2 - Chapter 5: Dynamic programming)
