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

Author： Avella Pasquale   Vasil'Ev Igor  

Publisher： Springer Publishing Company

ISSN： 1094-6136

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

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 Cutting Plane Algorithm for Linear Reverse Convex Programs

By Moshirvaziri K.  

Annals of Operations Research, Vol. 105, Iss. 1-4, 2001-07 ,pp. : 201-212

Springer Publishing Company

Access to resources Recommend Favorite

A Long-Step, Cutting Plane Algorithm for Linear and Convex Programming

By Mitchell J.E.  

Annals of Operations Research, Vol. 99, Iss. 1-4, 2000-12 ,pp. : 95-122

Springer Publishing Company

Access to resources Recommend Favorite