Concorde local cuts usage optimization analysis
The article concerns the experimental analysis of the traveling salesman (TSP) concorde branch & bound code efficiency with respect to asymmetric TSP instances. The main researched question is the relation between solving time and such parameters as: concorde local cuts settings, asymmetric TSP matrix substructure and instance size. Running time optimization methods are proposed.