麻省理工学院“开放式课程网页” | 史隆管理学院 | 15.082J 2003春季课程：网络最优化

透过观看许多可使用的动画来逐步走过网络最优化的主题。全套演讲笔记利用许多图和其它视觉材料来澄清抽象的概念。学生们独自或和一个伙伴完成偶尔涉及证明的作业。

Walk through the main topics in Network Optimization step-by-step by viewing the many animations available. The complete set of lecture notes makes use of many diagrams and other visuals to clarify abstract concepts. Students work by themselves or with a partner to complete assignments, which sometimes involve proofs.

15.082J/6.855J 是网流与其引申之理论和实践的一门高等研究生级课程。网流问题构成线性规划的一个问题子类并可应用在运输业, 物流业, 制造业, 计算机科学, 专案管理, 财务学及数个其它领域。这个主题将审视一些网流的应用并集中焦点在以下网流问题的关键特殊情况: 最短路径问题, 最大流量问题, 最少成本流量问题, 和多元物品流量问题。

15.082J/6.855J is an H-level graduate subject in the theory and practice of network flows and its extensions. Network flow problems form a subclass of linear programming problems with applications to transportation, logistics, manufacturing, computer science, project management, finance as well as a number of other domains. This subject will survey some of the applications of network flows and focus on key special cases of network flow problems including the following: the shortest path problem, the maximum flow problem, the minimum cost flow problem, and the multi-commodity flow problem.

技术需求
Technical Requirements

推荐由微软MicrosoftR PowerPointR 软件来观看本课程网站上的.ppt 文件。也可使用免费的微软 MicrosoftR PowerPointR 观看软件来观看.ppt 文件。

Microsoft® PowerPoint® software is recommended for viewing the .ppt files found on this course site. Free Microsoft® PowerPoint® viewer software can also be used to view the .ppt files.

Microsoft^® 和PowerPoint^® 是微软公司在美国和或其他国家的注册商标或商标。
Microsoft^® and PowerPoint^® are either registered trademarks or trademarks of Microsoft Corporation in the United States and/or other countries.