Geodesic
On the Gotlieb-Csima Time-Tabling Algorithm
Canadian journal of mathematics, Tome 20 (1968) no. 1, pp. 103-119

Voir la notice de l'article provenant de la source Cambridge University Press

This paper concerns an algorithm, proposed by C. C. Gotlieb (4) and modified by J. Csima (1; 2), for a recent combinatorial problem whose application includes the construction of school time-tables. Theoretically, the problem is related to systems of distinct subset representatives, the construction of Latin arrays, the colouring of graphs, and flows in networks (1; 2; 3). I t was conjectured by Gotlieb and Csima that if solutions to a given time-table problem existed, i.e. if time-tables incorporating certain pre-assigned meetings existed, their algorithm would find one. 
Dempster, M. A. H. On the Gotlieb-Csima Time-Tabling Algorithm. Canadian journal of mathematics, Tome 20 (1968) no. 1, pp. 103-119. doi: 10.4153/CJM-1968-013-7
@article{10_4153_CJM_1968_013_7,
     author = {Dempster, M. A. H.},
     title = {On the {Gotlieb-Csima} {Time-Tabling} {Algorithm}},
     journal = {Canadian journal of mathematics},
     pages = {103--119},
     year = {1968},
     volume = {20},
     number = {1},
     doi = {10.4153/CJM-1968-013-7},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-013-7/}
}
TY  - JOUR
AU  - Dempster, M. A. H.
TI  - On the Gotlieb-Csima Time-Tabling Algorithm
JO  - Canadian journal of mathematics
PY  - 1968
SP  - 103
EP  - 119
VL  - 20
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-013-7/
DO  - 10.4153/CJM-1968-013-7
ID  - 10_4153_CJM_1968_013_7
ER  - 
%0 Journal Article
%A Dempster, M. A. H.
%T On the Gotlieb-Csima Time-Tabling Algorithm
%J Canadian journal of mathematics
%D 1968
%P 103-119
%V 20
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-013-7/
%R 10.4153/CJM-1968-013-7
%F 10_4153_CJM_1968_013_7

[1] 1. Csima, J., Investigations on a time-table problem, Doctoral dissertation, (issued as a report of the Institute of Computer Science), Univ. of Toronto (1965). Google Scholar

[2] 2. Csima, J. and Gotlieb, C. C., Tests on a computer method for constructing school time-tables, Comm. ACM, 8 (1965), 160–163. Google Scholar

[3] 3. Dempster, M. A. H., Two algorithms for the time-table problem (to appear). Google Scholar

[4] 4. Gotlieb, C. C., The construction of class-teacher time-tables, Proc. I.F.I.P. Congress 62, Munich (Amsterdam, 1963), pp. 73–77. Google Scholar

[5] 5. Lions, J., Matrix reduction using the Hungarian algorithm for the generation of school timetables, Comm. ACM, 9 (1966), 349–354. Google Scholar

[6] 6. Lions, J., A counter-example for Gotlieb's Method for the construction of school timetables, Comm. ACM, 9 (1966), 697–698. Google Scholar

[7] 7. Lions, J., The Ontario school scheduling program, Comput. J., 10 (May, 1967), 14–21. Google Scholar

[8] 8. Ryser, H. J., Combinatorial mathematics, Carus Math. Monographs No. 14 (New York, 1963).10.5948/UPO9781614440147 Google Scholar | DOI

Cité par Sources :