A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem