Time-Tabling Problems: Should They Be Canonical? (Q3748052)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3984952
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time-Tabling Problems: Should They Be Canonical? |
scientific article; zbMATH DE number 3984952 |
Statements
Time-Tabling Problems: Should They Be Canonical? (English)
0 references
1986
0 references
computational experiments
0 references
generalized time-tabling problem
0 references
edge colourings in bipartite multigraphs
0 references
0.8163046836853027
0 references
0.7986912131309509
0 references
0.7948644161224365
0 references
0.7945337295532227
0 references
0.7830511331558228
0 references
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.
0 references