Abstract
The problem to divide many objects into k(k≧2) groups according to the similarity among objects is called the homogeneous clustering problem. In this study, the above problem with side resource constraints is called a resource constrained grouping problem (G) and discussed. First, the problem is formulated as a 0-1 integer programming problem and its several applications are mentioned. After presenting a simple solution method of its Lagrangean relaxation problem to determine a lower bound, effectiveness of the branch and bound method with the above lower bound is verified through some computational experiments. Finally, a strong lower bound of (G) using valid inequality is explained.
