15082J/6855 J网络优化15.082J / 6.855J Network Optimization |
|
课程网址: | http://ocw.mit.edu/courses/sloan-school-of-management/15-082j-net... |
主讲教师: | James Orlin |
开课单位: | 麻省理工学院 |
开课时间: | 信息不详。欢迎您在右侧留言补充。 |
课程语种: | 英语 |
中文简介: | 15.082J/6.855J是网络流及其扩展理论与实践的h级研究生课程。网络流问题是线性规划问题的一个子类,它应用于运输、物流、制造、计算机科学、项目管理、金融以及许多其他领域。本课题将考察网络流的一些应用,重点研究网络流问题的关键特殊情况,包括:最短路径问题、最大流量问题、最小成本流问题、多商品流问题。 |
课程简介: | 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. |
关 键 词: | 网络模型; 网络设计; 最大流算法; 最小成本流; 最短路径算法; 算法效率; 预置推算法; 数据结构 |
课程来源: | 麻省理工学院公开课 |
最后编审: | 2018-09-22:cmh |
阅读次数: | 58 |