We consider several subclasses of the problem of grouping n items (indexed 1, 2,⋯,n) into m subsets so as to minimize the function g(S1,⋯,Sm). In general, these problems are very difficult to solve to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback