An effective hybrid algorithm for university course timetabling

Author： Chiarandini Marco   Birattari Mauro   Socha Krzysztof   Rossi-Doria Olivia  

Publisher： Springer Publishing Company

ISSN： 1094-6136

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

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

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

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 supernodal formulation of vertex colouring with applications in course timetabling

By Burke Edmund  

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

Springer Publishing Company

Access to resources Recommend Favorite

RSEDP: an effective hybrid data placement algorithm for large-scale storage systems

By Xiao Nong   Chen Tao   Liu Fang  

The Journal of Supercomputing, Vol. 55, Iss. 1, 2011-01 ,pp. : 103-122

Springer Publishing Company

Access to resources Recommend Favorite