Reduced-Size Integer Linear Programming Models for String Selection Problems: Application to the Farthest String Problem.

We present integer programming models for some variants of the farthest string problem. The number of variables and constraints is substantially less than that of the integer linear programming models known in the literature. Moreover, the solution of the linear programming-relaxation contains only ... View More