 EMC Home |
New Titles |
All Titles |
Abstracts |
Topical Index |
Withdrawn |
CSS Home |
Search
|
Search |
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)
![[University of Washington]](http://www.washington.edu/home/graphics/uwsealf6.gif)
|
 |
|
|
|
|||
|
|||
![[EMC Logo]](http://www.washington.edu/classroom/emc/emctrans.gif)