Management Science: Trains, Planes, and Critical Paths
- 1986 ----- color ----- 29 min ----- vhs
- (For All Practical Purposes series, Part 3) Various algorithms are introduced, "nearest neighbor" or "greedy," that can aid in solving complex routing problems.
- Topics: (Education, Management, Mathematics)
|
|||
|
|||