MATH 3153A
0.50 credit · Main
Network problems: shortest path, spanning trees, flow problems, matching, routing. Complexity. Integer programming.
One of: Mathematics 2156A/B, Mathematics 3152A/B, or permission of the Department.
3 lecture hours.
No reviews yet - be the first.