A supernodal formulation of vertex colouring with applications in course timetabling

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.179, Iss.1, 2010-09, pp. : 105-130

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An effective hybrid algorithm for university course timetabling

By Chiarandini Marco Birattari Mauro Socha Krzysztof Rossi-Doria Olivia

Journal of Scheduling, Vol. 9, Iss. 5, 2006-10 ,pp. : 403-432

Springer Publishing Company

Access to resources Recommend Favorite

UNIVERSITY COURSE TIMETABLING USING CONSTRAINT HANDLING RULES

By Abdennadher Slim Marte Michael

Applied Artificial Intelligence, Vol. 14, Iss. 4, 2000-04 ,pp. : 311-325

Taylor & Francis Ltd

Access to resources Recommend Favorite

A MULTI-AGENT SYSTEM FOR UNIVERSITY COURSE TIMETABLING

By Strnad Damjan Guid Nikola

Applied Artificial Intelligence, Vol. 21, Iss. 2, 2007-02 ,pp. : 137-153

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Computational Study of a Cutting Plane Algorithm for University Course Timetabling

By Avella Pasquale Vasil'Ev Igor

Journal of Scheduling, Vol. 8, Iss. 6, 2005-12 ,pp. : 497-514

Springer Publishing Company

Access to resources Recommend Favorite

A Survey of Automated Timetabling

By Schaerf A.

Artificial Intelligence Review, Vol. 13, Iss. 2, 1999-04 ,pp. : 87-127

Springer Publishing Company

Access to resources Recommend Favorite