×

Weighted graphs and university course timetabling. (English) Zbl 0825.90529


MSC:

90B35 Deterministic scheduling theory in operations research
90C35 Programming involving graphs or networks
90-08 Computational methods for problems pertaining to operations research and mathematical programming
90C10 Integer programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Carlson, R. C.; Nemhauser, G. L., Scheduling to minimize interaction cost, Ops Res., 12, 52-58 (1966) · Zbl 0139.13202
[2] Carter, M. W., A survey of practical applications of examination timetabling algorithms, Ops Res., 34, 193-202 (1986)
[3] Ferland, J. A.; Roy, S., Timetabling problem for university as assignment of activities to resources, Computers Ops Res., 12, 207-218 (1985) · Zbl 0608.90042
[4] Krarup, J.; deWerra, D., Chromatic optimization: limitations, objectives, uses, references, Eur. J. Ops Res., 11, 1-19 (1982) · Zbl 0482.90066
[5] Mulvey, J. M., A classroom/time assignment model, Eur. J. Ops Res., 9, 64-70 (1982) · Zbl 0471.90061
[6] Tripathy, A., A Lagrangean approach to course timetabling, J. Opl Res. Soc., 31, 599-603 (1980) · Zbl 0434.90046
[7] deWerra, D., An introduction to timetabling, Eur. J. Ops Res., 19, 151-162 (1985)
[8] Papadimitriou, C. H.; Steiglitz, K., Combinatorial Optimization: Algorithms and Complexity (1982), Prentice-Hall: Prentice-Hall Englewood Cliffs, N.J · Zbl 0503.90060
[9] Gould, R., Graph Theory (1988), Cummings: Cummings New York
[10] Brelaz, D., New methods to color the vertices of a graph, Commun. ACM, 22, 251-256 (1979) · Zbl 0394.05022
[11] Manvel, B., Coloring large graphs, (Proceedings of the 1981 Southeastern Conference on Graph Theory, Combinatorics and Computer Science (1981)) · Zbl 0185.27703
[12] Singhal, J.; Marsten, R. E.; Morin, T. L., Fixed-order branch-and-bound methods for mixed-integer programming: the ZOOM system, Ops Res Soc. Am. J. Comput., 1, 44-51 (1989) · Zbl 0753.90050
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.