Highly Influenced

@article{Ji2007BranchandpriceandcutOT, title={Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement}, author={Xiaoyun Ji and John E. Mitchell}, journal={Discrete Optimization}, year={2007}, volume={4}, pages={87-102} }

- Published 2007 in Discrete Optimization
DOI:10.1016/j.disopt.2006.10.009

Given a complete graph Kn = (V, E) with edge weight ce on each edge, we consider the problem of partitioning the vertices of graph Kn into subcliques that have at least S vertices, so as to minimize the total weight of the edges that have both endpoints in the same subclique. In this paper, we consider using the branch-and-price method to solve the problem. We demonstrate the necessity of cutting planes for this problem and suggest effective ways of adding cutting planes in the branch-andpriceâ€¦Â CONTINUE READING