python pulp solve TSP

I am looking for an experienced Python programmer to help me solve a Travelling Salesman Problem (TSP). The size of my TSP problem is medium, consisting of approximately 50-100 cities. I need my programmer to be able to apply either Branch and Bound / Subtour Elimination / both methods to solve the problem, but have some flexibility in terms of the algorithm used. But you cannot cat any variables to integer or binary. As this project is of medium size, I have a preferred deadline in mind but it is not urgent and can be flexible. If you think you have the right skills to help me solve my TSP using the best algorithm then I'd love to hear from you.