Thesiss

This thesis presents two applications of combinatorial optimization. The first part contains a detailed description of a conference scheduling problem. We model the problem as a symmetric clustering problem, or a variant of minimum k -partition we call capacitated k -partition .…