This framework is designed to be used for any backtracking algorithm, and it is not limited to a specific problem. You need to implement the (quite simple) interface, and then you can use the solve() ...
The backtracking search optimization algorithm (BSA) is a population-based evolutionary algorithm for numerical optimization problems. BSA has a powerful global exploration capacity while its local ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback