Abstract: The Travelling Salesman Problem (TSP) is a well known method for the optimisation problem that asks you to find the shortest route that visits each city in a set exactly once and then goes ...

This package implements python bindings for the ORbit Counting Algorithm. The original source code was modified to avoid memory leaks upon repeated function calls and allow for parallel orbit counting ...

Abstract: In combinatorial optimization problems, traditional optimization algorithms are often difficult to efficiently find the global optimal solution. This paper studies the application of genetic ...