Een indelingsprobleem
JAC. M. ANTHONISSE · Statistica Neerlandica · 1968
Summary A branch and bound algorithm is given to solve the following problem: To each pair of elements (i,j) from a set X={l,…, n} a number rij with rij≥ 0, rij=rij and rij= 0 has been assigned. Find a prescribed number of disjoint subsets P1…,Pm from X, such that Experiments indicate that an optimal solution is usually found in a small number of iterations, but the verification may be rather time consuming. The algorithm may be used to find the minimum value of m for which a partitioning of X with z= 0 exists. The algorithm appears to be efficient for finding this ‘chromatic number of a graph’.