An improved integer linear programming formulation for the closest 0-1 string problem.

Claudio Arbib Mara Servilio Paolo Ventura

Published in: Comput. Oper. Res. (2017)

Keyphrases

integer linear programming formulation
quadratic assignment problem
lower bound
data sets
training data
text categorization
constraint satisfaction
orders of magnitude
computational efficiency
convex hull
integer programming