A supernodal formulation of vertex colouring with applications in course timetabling
- 30 March 2010
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 179 (1) , 105-130
Abstract
No abstract availableKeywords
All Related Versions
This publication has 52 references indexed in Scilit:
- On the asymmetric representatives formulation for the vertex coloring problemDiscrete Applied Mathematics, 2008
- A dualistic approach to bounding the chromatic number of a graphEuropean Journal of Combinatorics, 2008
- Models and solution techniques for frequency assignment problemsAnnals of Operations Research, 2007
- Packing and partitioning orbitopesMathematical Programming, 2007
- Using stable sets to bound the chromatic numberInformation Processing Letters, 2003
- Exploiting orbits in symmetric ILPMathematical Programming, 2003
- Pruning by isomorphism in branch-and-cutMathematical Programming, 2002
- Generating all the acyclic orientations of an undirected graphInformation Processing Letters, 1999
- Properties of some ILP formulations of a class of partitioning problemsDiscrete Applied Mathematics, 1998
- On the X-join decomposition for undirected graphsDiscrete Applied Mathematics, 1979