Integer programming problems solved using Gurobi backend and CVXPY.
For CVXPY Installation, see https://www.cvxpy.org/install/index.html.
For Gurobi, see the documentation here - http://www.gurobi.com/documentation/
- Travelling Salesman problem with Miller-Tucker-Zemlin constraints. The Integer Linear Program (ILP) is formulated and solved for random cost matrices.