Key points are not available for this paper at this time.
Abstract We formulate the set partitioning problem as a matching problem with simple side constraints. As a result we obtain a Lagrangian relaxation of the set partitioning problem in which the primal problem is a matching problem. To solve the Lagrangian dual we must solve a sequence of matching problems each with different edge‐weights. We use the cyclic coordinate method to iterate the multipliers, which implies that successive matching problems differ in only two edge‐weights. This enables us to use sensitivity analysis to modify one optimal matching to obtain the next one. We give theoretical and empirical comparisons of these dual bounds with the conventional linear programming ones.
Nemhauser et al. (Sat,) studied this question.