A supernodal formulation of vertex colouring with applications in course timetabling

EK Burke, J Mareček, AJ Parkes, H Rudová - Annals of Operations …, 2010 - Springer
For many problems in scheduling and timetabling, the choice of a mathematical
programming formulation is determined by the formulation of the graph colouring …

[HTML][HTML] Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results

P Hansen, M Labbé, D Schindl - Discrete Optimization, 2009 - Elsevier
We consider two (0, 1)-linear programming formulations of the graph (vertex-) coloring
problem, in which variables are associated with stable sets of the input graph. The first one …

[图书][B] Set covering and packing formulations of graph coloring: algorithms and first polyhedral results

P Hansen, M Labbé, D Schindl - 2005 - Citeseer
Abstract We consider two (0, 1)-linear programming formulations of the graph (vertex-)
coloring problem, in which variables are associated to stable sets of the input graph. The first …

A branch-price-and-cut algorithm for graph coloring

RP Hulst - 2021 - essay.utwente.nl
Branch-and-price approaches for graph coloring using the set covering formulation have
been shown to be effective, particularly in computing strong lower bounds. This thesis …

Suboptimal colorings and solution of large chromatic scheduling problems

I Blöchliger - 2005 - infoscience.epfl.ch
Graph Coloring is a very active field of research in graph theory as well as in the domain of
the design of efficient heuristics to solve problems which, due to their computational …

[PDF][PDF] Univerzitní rozvrhování pomocí celoˇcíselného programování

J Marecek - is.muni.cz
Course timetabling with integer programming Page 1 MASARYKOVA UNIVERZITA
FAKULTA INFORMATIKY }w¡¢£¤¥¦§ !"#$%&123456789@ACDEFGHIPQRS`ye| Univerzitní …