Show simple item record

15.082J / 6.855J Network Optimization, Spring 2003

dc.contributor.authorOrlin, Jamesen_US
dc.coverage.temporalSpring 2003en_US
dc.date.issued2003-06
dc.identifier15.082J-Spring2003
dc.identifierlocal: 15.082J
dc.identifierlocal: 6.855J
dc.identifierlocal: IMSCP-MD5-ad0dbc2e02a49a25e04c66b2074aa805
dc.identifier.urihttp://hdl.handle.net/1721.1/74617
dc.description.abstract15.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.languageen-USen_US
dc.relationen_US
dc.rights.uriUsage 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.subjectnetwork flowsen_US
dc.subjectextensionsen_US
dc.subjectnetwork flow problemsen_US
dc.subjecttransportationen_US
dc.subjectlogisticsen_US
dc.subjectmanufacturingen_US
dc.subjectcomputer scienceen_US
dc.subjectproject managementen_US
dc.subjectfinanceen_US
dc.subjectthe shortest path problemen_US
dc.subjectthe maximum flow problemen_US
dc.subjectthe minimum cost flow problemen_US
dc.subjectthe multi-commodity flow problemen_US
dc.subjectcommunicationen_US
dc.subjectsystemsen_US
dc.subjectapplicationsen_US
dc.subjectefficiencyen_US
dc.subjectalgorithmsen_US
dc.subjecttrafficen_US
dc.subjectequilibriumen_US
dc.subjectdesignen_US
dc.subjectmplementationen_US
dc.subjectlinear programmingen_US
dc.subjectimplementationen_US
dc.subjectcomputeren_US
dc.subjectscienceen_US
dc.subjectlinearen_US
dc.subjectprogrammingen_US
dc.subjectnetworken_US
dc.subjectflowen_US
dc.subjectproblemsen_US
dc.subjectprojecten_US
dc.subjectmanagementen_US
dc.subjectmaximumen_US
dc.subjectminimumen_US
dc.subjectcosten_US
dc.subjectmulti-commodityen_US
dc.subjectshortesten_US
dc.subjectpathen_US
dc.subject15.082Jen_US
dc.subject6.855Jen_US
dc.subject15.082en_US
dc.subject6.855en_US
dc.subjectNetwork analysis (Planning)en_US
dc.subjectMathematical optimizationen_US
dc.title15.082J / 6.855J Network Optimization, Spring 2003en_US
dc.title.alternativeNetwork Optimizationen_US
dc.typeLearning Object
dc.contributor.departmentSloan School of Management
dc.contributor.departmentMassachusetts Institute of Technology. Department of Chemical Engineering
dc.contributor.departmentMassachusetts Institute of Technology. Department of Civil and Environmental Engineering
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mechanical Engineering
dc.contributor.departmentMassachusetts Institute of Technology. Department of Nuclear Science and Engineering


Files in this item

Thumbnail
Name:
15-082j-spring-2003/contents/i ...
Size:
17.40Kb
Format:
HTML
View/Open

This item appears in the following Collection(s)

Show simple item record