dc.contributor.author | Orlin, James | en_US |
dc.coverage.temporal | Spring 2003 | en_US |
dc.date.issued | 2003-06 | |
dc.identifier | 15.082J-Spring2003 | |
dc.identifier | local: 15.082J | |
dc.identifier | local: 6.855J | |
dc.identifier | local: IMSCP-MD5-ad0dbc2e02a49a25e04c66b2074aa805 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/74617 | |
dc.description.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. | en_US |
dc.language | en-US | en_US |
dc.relation | | en_US |
dc.rights.uri | 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. | en_US |
dc.subject | network flows | en_US |
dc.subject | extensions | en_US |
dc.subject | network flow problems | en_US |
dc.subject | transportation | en_US |
dc.subject | logistics | en_US |
dc.subject | manufacturing | en_US |
dc.subject | computer science | en_US |
dc.subject | project management | en_US |
dc.subject | finance | en_US |
dc.subject | the shortest path problem | en_US |
dc.subject | the maximum flow problem | en_US |
dc.subject | the minimum cost flow problem | en_US |
dc.subject | the multi-commodity flow problem | en_US |
dc.subject | communication | en_US |
dc.subject | systems | en_US |
dc.subject | applications | en_US |
dc.subject | efficiency | en_US |
dc.subject | algorithms | en_US |
dc.subject | traffic | en_US |
dc.subject | equilibrium | en_US |
dc.subject | design | en_US |
dc.subject | mplementation | en_US |
dc.subject | linear programming | en_US |
dc.subject | implementation | en_US |
dc.subject | computer | en_US |
dc.subject | science | en_US |
dc.subject | linear | en_US |
dc.subject | programming | en_US |
dc.subject | network | en_US |
dc.subject | flow | en_US |
dc.subject | problems | en_US |
dc.subject | project | en_US |
dc.subject | management | en_US |
dc.subject | maximum | en_US |
dc.subject | minimum | en_US |
dc.subject | cost | en_US |
dc.subject | multi-commodity | en_US |
dc.subject | shortest | en_US |
dc.subject | path | en_US |
dc.subject | 15.082J | en_US |
dc.subject | 6.855J | en_US |
dc.subject | 15.082 | en_US |
dc.subject | 6.855 | en_US |
dc.subject | Network analysis (Planning) | en_US |
dc.subject | Mathematical optimization | en_US |
dc.title | 15.082J / 6.855J Network Optimization, Spring 2003 | en_US |
dc.title.alternative | Network Optimization | en_US |