CSCI 5330G - Network Optimization

This course provides a comprehensive and up-to-date study of network optimization problems. Network optimization includes both major types of optimization problems: continuous and discrete. Network flow optimization models and extensions are studied, with a focus on the theory and algorithms for a wide-ranging collection of network problems such as shortest path, maximum flow, minimum cost flow, spanning tree, matching, traveling salesman, multicommodity flow and generalized assignment. Both linear programming and combinatorial optimization methods are discussed in the context of formulating and solving the network problems.
Credit hours: 3
Prerequisite(s): An undergraduate course on computer networking that covers the fundamentals, e.g., CSCI 3150 (Computer Networks).