Branch & Cut LP Solver

Branch & Cut Solver with Lazy Constraints

This version passes the spec example, and hourglass graphs
Hourglass where the optimal solution is to drop everyone off directly at their house and where the optimal solution is to go to Campanile and back and have everyone walk back