Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
- 27 March 1991
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 51 (2), 248-258
- https://doi.org/10.1016/0377-2217(91)90254-s
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Simulated annealing: An introductionStatistica Neerlandica, 1989
- Consecutive colorings of graphsMathematical Methods of Operations Research, 1988
- Combinatorial Optimization Problems with Soft and Hard RequirementsJournal of the Operational Research Society, 1987
- A generalized implicit enumeration algorithm for graph coloringCommunications of the ACM, 1985
- An introduction to timetablingEuropean Journal of Operational Research, 1985
- Approximate Colouring Algorithms for Composite GraphsJournal of the Operational Research Society, 1983
- Chromatic optimisation: Limitations, objectives, uses, referencesEuropean Journal of Operational Research, 1982
- New methods to color the vertices of a graphCommunications of the ACM, 1979
- Algorithms for finding in the lump both bounds of the chromatic number of a graphThe Computer Journal, 1976
- Chromatic Scheduling and the Chromatic Number ProblemManagement Science, 1972