Network Optimization
MIT OpenCourseWare's graduate subject on network flows and their extensions, cross-listed as 15.082J/6.855J/ESD.78J across the Sloan School, EECS, and the Engineering Systems Division. The course covers network flow problems as a subclass of linear programming, working through the shortest path problem, the maximum flow problem, the minimum cost flow problem, and the multi-commodity flow problem, with applications spanning transportation, logistics, manufacturing, computer science, project management, and finance. Materials include lecture notes, assignments, and exams as published by MIT OpenCourseWare, free to access with no certificate offered. Suited to graduate students or advanced undergraduates with a background in linear programming who want a rigorous treatment of network optimization theory and its algorithmic special cases.