Network flow

Solve the airline scheduling problem shown in Figure 7.17 with one more added flight: PIT 9 to LAS 4. (a) Convert it first to the circulation problem. (b) Then convert the problem to the maximum flow problem. (c) Solve the problem for k=2 and k=3.