Minimum Cost Network Flows
Below is a java applet that will present a set of min-cost network-flow
problems for you to solve. You're job is to solve each problem (either by
finding an optimal solution or demonstrating that the problem is infeasible or
unbounded). After correctly solving a problem, the applet will immediately
give you a new one. After you have solved all the problems in the set,
press the Submit button to email your score to your instructor
(whose email address must be supplied below).