the code is easily interpretable, and the README helps by introducing the goal of the process.
your code provides a solid implementation of Tabu Search for the Set Cover problem, combining a greedy initialization, neighbor sampling, and a tabu list to escape local optima.
I think it is a good solution comparing the results obtained with those shared by others people. To reduce the execution time, ITERATION_NO_IMPROVEMENTS could certainly be limited, or adapted to the size of the problem
the code is easily interpretable, and the README helps by introducing the goal of the process.
your code provides a solid implementation of Tabu Search for the Set Cover problem, combining a greedy initialization, neighbor sampling, and a tabu list to escape local optima.
I think it is a good solution comparing the results obtained with those shared by others people. To reduce the execution time, ITERATION_NO_IMPROVEMENTS could certainly be limited, or adapted to the size of the problem