15.082J / 6.855J Network Optimization, Spring 2003
Author(s)
Orlin, James
Download15082jspring2003/contents/index.htm (17.40Kb)
Alternative title
Network Optimization
Metadata
Show full item recordAbstract
15.082J/6.855J is an Hlevel 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 multicommodity flow problem.
Date issued
200306Other identifiers
15.082JSpring2003
local: 15.082J
local: 6.855J
local: IMSCPMD5ad0dbc2e02a49a25e04c66b2074aa805
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 multicommodity 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, multicommodity, shortest, path, 15.082J, 6.855J, 15.082, 6.855, Network analysis (Planning), Mathematical optimization
Collections
Related items
Showing items related by title, author, creator and subject.

Scaling algorithms for multicommodity flow problems and network flow problems with side constraits
Schneur, Rina (Massachusetts Institute of Technology, 1991)