MATH 482, Spring 2013 - Homework 2
Assigned Wednesday 09/18. Due Friday 09/20.
Problems Assigned: 1, 2, 3.a., 4.c.
1. (Assigned! 5pts ) Consider the graph below.
Find a shortest path and prove optimality using duality.
Label the vertices in the left colum
MATH 482, Spring 2013 - Homework 5
Assigned Monday 11/04. Due Monday 11/11.
For this homework, solve four of the following ve problems, but denitely complete problems 4 and
5. Each is worth 5 points. Problem 1 has a point breakdown for the parts, should y
Implementation Assignment 3
Problem: Maximum or Minimum Perfect Matchings in Bipartite Graphs
In this report, you will implement the augmenting path algorithm for maximum matching in unweighted bipartite graphs and the Hungarian algorit
Implementation Assignment 2
Max Flows and Min Cuts
Problem: Maximum Flows and Minimum Cuts
After 5 path augmentations, we nd that the maximum ow value is 17. The non-zero ow values
ra : 5, rb : 3, rc : 7, ai : 5, bj : 3,
cj : 6,
MATH 482, Spring 2013 - Homework 4
Assigned Monday 10/07. Due Wednesday 10/09.
Assigned: 1.e, 2.d, 3.b, 4.a.
1. Find a maximumweight perfect matching and a minimum-weight vertex cover for the bipartite
graphs with weight matrices given below. (Assigned:
Implementation Assignment 1
Linear and Integer Programs
Problem: Linear and Integer Programs
We have discussed linear programs at length now, but have not discussed actual algorithms to solve
them! In this assignment, you will use a com