Search Results

EMSEĀ 6730. Integer and Network Programming. 3 Credits.

Combinatorial optimization problems: algorithms and applications. Network problems: minimum spanning tree, shortest path, maximum flows, minimum cost flows, optimal matchings, routing problems. Complexity theory. Enumeration and cutting plane methods for solving integer programs. Prerequisite: EMSE 6701 or permission of instructor.