Approximate Colouring Algorithms for Composite Graphs

1 June 1983

journal article
Published by Taylor & Francis in Journal of the Operational Research Society

Vol. 34 (6) , 503-509
https://doi.org/10.1057/jors.1983.117

Abstract

School timetabling problems containing multiple period lessons are formulated in terms of the colouring of composite graphs. Several approximate colouring algorithms are proposed and compared empirically.

Keywords

INFORMATION SYSTEMS
OPERATIONS RESEARCH
OPERATIONAL RESEARCH
RELIABILITY
INVENTORY
COMMUNICATIONS TECHNOLOGY
MARKETING
PRODUCTION
FORECASTING
PROJECT MANAGEMENT
SCHEDULING
LOGISTICS
MANAGEMENT SCIENCE
COMPUTER SCIENCE
LOCATION
INFORMATION TECHNOLOGY
INVESTMENT

This publication has 0 references indexed in Scilit: