Searching for 15.082 : 4 results found | RSS Feed for this search

15.082J Network Optimization (MIT) 15.082J Network Optimization (MIT)

Description

15.082J/6.855J/ESD.78J is a 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, and 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. We will also consider other extensions of network flow problems. 15.082J/6.855J/ESD.78J is a 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, and 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. We will also consider other extensions of network flow problems.

Subjects

15.082 | 15.082 | 6.855 | 6.855 | ESD.78 | ESD.78 | network models | network models | network design | network design | maximum flow algorithm | maximum flow algorithm | minimum cost flow | minimum cost flow | shortest path algorithm | shortest path algorithm | algorithm efficiency | algorithm efficiency | preflow push algorithm | preflow push algorithm | data structures | data structures

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

15.082J Network Optimization (MIT) 15.082J Network Optimization (MIT)

Description

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. 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 | network flows | extensions | extensions | network flow problems | network flow problems | transportation | transportation | logistics | logistics | manufacturing | manufacturing | computer science | computer science | project management | project management | finance | finance | the shortest path problem | the shortest path problem | the maximum flow problem | the maximum flow problem | the minimum cost flow problem | the minimum cost flow problem | the multi-commodity flow problem | the multi-commodity flow problem | communication | communication | systems | systems | applications | applications | efficiency | efficiency | algorithms | algorithms | traffic | traffic | equilibrium | equilibrium | design | design | mplementation | mplementation | linear programming | linear programming | implementation | implementation | computer | computer | science | science | linear | linear | programming | programming | network | network | flow | flow | problems | problems | project | project | management | management | maximum | maximum | minimum | minimum | cost | cost | multi-commodity | multi-commodity | shortest | shortest | path | path | 15.082 | 15.082 | 6.855 | 6.855

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

15.082J Network Optimization (MIT)

Description

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.082 | 6.855

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

15.082J Network Optimization (MIT)

Description

15.082J/6.855J/ESD.78J is a 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, and 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. We will also consider other extensions of network flow problems.

Subjects

15.082 | 6.855 | ESD.78 | network models | network design | maximum flow algorithm | minimum cost flow | shortest path algorithm | algorithm efficiency | preflow push algorithm | data structures

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata