A supernodal formulation of vertex colouring with applications in course timetabling
Year of publication: |
2010
|
---|---|
Authors: | Burke, Edmund K. ; Mareček, Jakub ; Parkes, Andrew J. ; Rudová, Hana |
Published in: |
Annals of operations research. - Dordrecht, The Netherlands : Springer Nature B.V., ISSN 0254-5330, ZDB-ID 252629-3. - Vol. 179.2010, p. 105-130
|
Subject: | Scheduling-Verfahren | Scheduling problem | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | USA | United States | Theorie | Theory |
-
A branch and bound algorithm for the job shop scheduling problem
Błażewicz, Jacek, (1998)
-
Almost all Berge graphs are perfect
Prömel, Hans Jürgen, (1991)
-
A simpler characterization of a spectral lower bound on the clique number
Yıldırım, E. Alper, (2010)
- More ...
-
A branch-and-cut procedure for the Udine Course Timetabling problem
Burke, Edmund K., (2012)
-
A supernodal formulation of vertex colouring with applications in course timetabling
Burke, Edmund K., (2010)
-
A branch-and-cut procedure for the Udine Course Timetabling problem
Burke, Edmund K., (2012)
- More ...