IE 3087 - NETWORK-BASED OPTIMIZATION

Minimum Credits: 3
Maximum Credits: 3
This course covers graphs, digraphs and related concepts, node and edge covering problems, Euler tours, Hamiltonian cycles, tsp, set covering and matching problems, shortest path problems, maximum flow problems and minimum cost network flow problems.
Academic Career: Graduate
Course Component: Lecture
Grade Component: Grad Letter Grade
Course Requirements: PROG: Swanson School of Engineering

Click here for class schedule information.

Add to Portfolio.

Close Window