Courses:

Engineering and Applied Sciences >> Computer Science


For Course Instructors

  • Advertise your course for free
  • Feature your course listing
  • Create course discussion group
  • Link to your course page
  • Increase student enrollment

More Info...>>


Course Info

  • Course Number / Code:
  • 6.855J (Spring 2003) 
  • Course Title:
  • Network Optimization 
  • Course Level:
  • Graduate 
  • Offered by :
  • Massachusetts Institute of Technology (MIT)
    Massachusetts, United States  
  • Department:
  • Sloan School of Management 
  • Course Instructor(s):
  • Prof. James Orlin 
  • Course Introduction:
  •  


  • 15.082J / 6.855J Network Optimization



    Spring 2003




    Course Highlights


    Walk through the main topics in Network Optimization step-by-step by viewing the many animations available. The complete set of lecture notes makes use of many diagrams and other visuals to clarify abstract concepts. Students work by themselves or with a partner to complete assignments, which sometimes involve proofs.


    Course 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.


    Technical Requirements


    Special software is required to use some of the files in this course: .ppt.


    *Some translations represent previous versions of courses.

     

ACKNOWLEDGEMENT:
This course content is a redistribution of MIT Open Courses. Access to the course materials is free to all users.






© 2017 Coursepedia.com, by Higher Ed Media LLC. All Rights Reserved.