15.082J / 6.855J Network Optimization, Spring 2003

Orlin, James

Author(s)

Orlin, James

Download15-082j-spring-2003/contents/index.htm (17.40Kb)

Alternative title

Network Optimization

Terms of use

Usage Restrictions: This site (c) Massachusetts Institute of Technology 2012. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license") unless otherwise noted. The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions.

Metadata

Show full item record

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.

Date issued

2003-06

URI

http://hdl.handle.net/1721.1/74617

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

Other identifiers

15.082J-Spring2003

local: 15.082J

local: 6.855J

local: 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

Collections

MIT OCW Archived Courses