TSPA_Branch_And_Cut_Gurobi_Separation
MATLAB implementation of a branch-and-cut algorithm for the Asymmetric Travelling Salesman Problem (ATSP), using the Gurobi solver with degree constraints and subtour-elimination constraints separated via an integer-programming (ILP) separation problem. Operations research / integer programming.
- 3
- MATLAB
- Apache-2.0
- 5 wk ago