A branch-and-bound algorithm for finding an optimal colouring of the blocks of a Steiner triple system is developed. Two simple but powerful heuristics are devised which improve the method. Applications to scheduling and the design of experiments are outlined.
|Original language||English (US)|
|Number of pages||2|
|State||Published - Aug 1982|
ASJC Scopus subject areas
- Computer Science(all)