Time-Tabling Problems: Should They Be Canonical?

From MaRDI portal
Publication:3748052





This note reports on some computational experiments related to the generalized time-tabling problem (GTP) and to the simple time-tabling problem (STP). These problems are equivalent to problems of finding edge colourings in bipartite multigraphs. It was suggested by various authors that embedding a GTP (or an STP) into a canonical GTP (or STP) of larger size but more regular structure would lead to an efficient algorithm. We present a modified algorithm which leaves the initial GTP (or STP) unaltered. Computational experiments on some typical time- tabling problems (STPS) and some randomly generated (GTPS) indicate that the modified algorithm generally results in faster execution times.











This page was built for publication: Time-Tabling Problems: Should They Be Canonical?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3748052)