A branch-and-cut procedure for the Udine Course Timetabling problem
- 2 February 2011
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 194 (1) , 71-87
Abstract
No abstract availableKeywords
This publication has 45 references indexed in Scilit:
- A branch-and-cut procedure for the Udine Course Timetabling problemAnnals of Operations Research, 2011
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and resultsAnnals of Operations Research, 2010
- ITC2007 solver description: a hybrid approachAnnals of Operations Research, 2009
- A cutting plane algorithm for graph coloringDiscrete Applied Mathematics, 2008
- On unions and dominants of polytopesMathematical Programming, 2004
- Properties of some ILP formulations of a class of partitioning problemsDiscrete Applied Mathematics, 1998
- Automated University Timetabling: The State of the ArtThe Computer Journal, 1997
- Network Flows: Theory, Algorithms, and Applications.Journal of the Operational Research Society, 1994
- Facets of the three-index assignment polytopeDiscrete Applied Mathematics, 1989
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965