Partial reformulation-linearization based optimization models for the Golomb ruler problem

Abstract

In this paper, we provide a straightforward proof of a conjecture proposed in \cite{Duxbury2021} regarding the optimal solutions of a non-convex mathematical programming model of the Golomb ruler problem. Subsequently, we investigate the computational efficiency of four new binary mixed-integer linear programming models to compute optimal Golomb rulers. These models are derived from a well-known nonlinear integer model proposed in \cite{Kocuk2019}, utilizing the reformulation-linearization technique. \modif{Finally, we provide the correct outputs of the greedy heuristic proposed in \cite{Duxbury2021} and correct some false conclusions stated or implied therein.}