Solved im using sagemath in a jupyter environment if you

Transcribed image text:

Given a local search (LS) algorithm for the optimisation version of the Golomb ruler problem. The algorithm is basically a hill-climbing algorithm that tries to minimise the constraint violations plus the length of the rulers. Try to run the algorithm on small as well as large problems such as those having

Read more here: Source link