The set partitioning (SP) problem is a problem that is encountered often in real-life situations. Much attention has been given in the literature to finding the solution of this problem. The project is aimed at developing and implementing an algorithm to solve the SP problem optimally in a reasonable amount of time for large, real-life problems. Besides the pure SP problem, we also want to consider other problems that are related to the SP problem , but ask for a slightly different solution method. Starting point of the research is a code that is designed to solve the pure SP problem optimally, implemented in C++ by Hein Fleuren.
|Short title||Set partitioning|
|Effective start/end date||1/09/01 → 1/09/05|