A Branch-and-Cut for the Traveling Salesman Problem
In this repository you will find a C++ implementation of a Branch-and-Cut algorithm for the Traveling Salesman Problem. The cuts were implemented based on the paper A Simple Min-Cut Algorithm.
| Name | Name | Last commit date | ||
|---|---|---|---|---|
In this repository you will find a C++ implementation of a Branch-and-Cut algorithm for the Traveling Salesman Problem. The cuts were implemented based on the paper A Simple Min-Cut Algorithm.