15.082J / 6.855J Network Optimization, Spring 2003
Name
15-082j-spring-2003/contents/index.htm
Size
17.4 KB
Format
HTML
Checksum (MD5)
30ced14c998ad7eb6d4cdb5dbff55c44
Author(s)
Orlin, James
Alternative Title
Network Optimization
Date Issued
June 2003
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.
Subjects
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
MIT Department
Sloan School of Management
Massachusetts Institute of Technology. Department of Chemical Engineering
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Department of Mathematics
Massachusetts Institute of Technology. Department of Mechanical Engineering
Massachusetts Institute of Technology. Department of Nuclear Science and Engineering
Terms of Use
Persistent DSpace Link
