A conjecture on a continuous optimization model for the Golomb Ruler Problem
A conjecture on a continuous optimization model for the Golomb Ruler Problem
A Golomb Ruler (GR) is a set of integer marks along an imaginary ruler such that all the distances of the marks are different. Computing a GR of minimum length is associated to many applications (from astronomy to information theory). Although not yet demonstrated to be NP-hard, the problem is …