# 15.082J / 6.855J Network Optimization, Spring 2003

Alternative Title:
Network Optimization

Author:
Orlin, James

Date Issued:
2003-06

Abstract:
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.

Other Identifiers:
15.082J-Spring2003

Other Identifiers:
15.082J

6.855J

IMSCP-MD5-ad0dbc2e02a49a25e04c66b2074aa805

Keywords:
network flows, extensions, network flow problems, transportation, logistics, manufacturing, computer science, project management, finance, the shortest path problem, the maximum flow problem, the minimum cost flow problem, the multi-commodity flow problem, communication, systems, applications, efficiency, algorithms, traffic, equilibrium, design, mplementation, linear programming, implementation, computer, science, linear, programming, network, flow, problems, project, management, maximum, minimum, cost, multi-commodity, shortest, path, 15.082J, 6.855J, 15.082, 6.855, Network analysis (Planning), Mathematical optimization, 111002, System, Networking, and LAN/WAN Management/Manager

Show full item metadata