Linear and Integer Programming Final Project CAAM 571 Fall 2018 Rice University
Implementation in Python of a branch-and-cut solver for the Travelling Salesman Problem. Derived an algorithm to generate subtour elimination constrains based on M. Stoer and F. Wagner. A Simple Min-Cut Algorithm, J of ACM, 1997