Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths

Cangalovic, Mirjana and Schreuder, Jan A.M. (1991) Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths. European Journal of Operational Research, 51 (2). pp. 248-258. ISSN 0377-2217

Preview

PDF
654Kb

Abstract:	An exact algorithm is presented for determining the interval chromatic number of a weighted graph. The algorithm is based on enumeration and the Branch-and-Bound principle. Computational experiments with the application of the algorithm to random weighted graphs are given. The algorithm and its modifications are used for solving timetabling problems with lectures of different lengths.
Item Type:	Article
Copyright:	© 1991 Elsevier
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/72996
Official URL:	http://dx.doi.org/10.1016/0377-2217(91)90254-S
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 140487