Algorithmes de coloration de graphes tenant compte d'une large gamme de contraintes dans l'établissement d'un horaire de cours d'une institution supérieure ou universitaire

Authors

  • O. Henkes F.N.O.P. Namur
  • J. Leclercq F.N.O.P. Namur

Abstract

A time-matrix is used in order to take into account the various kinds of pedagogical constraints. A lot of methods are described and compared on practical basis by mean of simulations using a package implemented by 0. Henkes.

Downloads

Published

1982-09-01

How to Cite

Henkes, O., & Leclercq, J. (1982). Algorithmes de coloration de graphes tenant compte d’une large gamme de contraintes dans l’établissement d’un horaire de cours d’une institution supérieure ou universitaire. JORBEL - Belgian Journal of Operations Research, Statistics, and Computer Science, 22(3), 20–36. Retrieved from https://orbel.be/jorbel/index.php/jorbel/article/view/406

Issue

Vol. 22 No. 3 (1982)

Section

Articles