Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/15733
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBurke, Edmund-
dc.contributor.authorMaracek, Jakub-
dc.contributor.authorParkes, Andrew J-
dc.contributor.authorRudova, Hana-
dc.date.accessioned2018-02-17T23:32:01Z-
dc.date.issued2010-09-
dc.identifier.urihttp://hdl.handle.net/1893/15733-
dc.description.abstractFor many problems in scheduling and timetabling, the choice of a mathematical programming formulation is determined by the formulation of the graph colouring component. This paper briefly surveys seven known integer programming formulations of vertex colouring and introduces a new approach using "supernodes". In the definition of George and McIntyre (SIAM J. Numer. Anal. 15(1):90-112, 1978), a "supernode" is a complete subgraph, within which every pair of vertices have the same neighbourhood outside of the subgraph. A polynomial-time algorithm for obtaining the best possible partition of an arbitrary graph into supernodes is given. This makes it possible to use any formulation of vertex multicolouring to encode vertex colouring. Results of empirical tests on benchmark instances in graph colouring (DIMACS) and timetabling (Udine Course Timetabling) are also provided and discussed.en_UK
dc.language.isoen-
dc.publisherSpringer-
dc.relationBurke E, Maracek J, Parkes AJ & Rudova H (2010) A supernodal formulation of vertex colouring with applications in course timetabling, Annals of Operations Research, 179 (1), pp. 105-130.-
dc.rightsThe publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.-
dc.subjectVertex colouringen_UK
dc.subjectGraph colouringen_UK
dc.subjectMulticolouringen_UK
dc.subjectSupernodeen_UK
dc.subjectModuleen_UK
dc.subjectInteger programmingen_UK
dc.titleA supernodal formulation of vertex colouring with applications in course timetablingen_UK
dc.typeJournal Articleen_UK
dc.rights.embargodate2999-12-31T00:00:00Z-
dc.rights.embargoreasonThe publisher does not allow this work to be made publicly available in this Repository therefore there is an embargo on the full text of the work.-
dc.identifier.doihttp://dx.doi.org/10.1007/s10479-010-0716-z-
dc.citation.jtitleAnnals of Operations Research-
dc.citation.issn0254-5330-
dc.citation.volume179-
dc.citation.issue1-
dc.citation.spage105-
dc.citation.epage130-
dc.citation.publicationstatusPublished-
dc.citation.peerreviewedRefereed-
dc.type.statusPublisher version (final published refereed version)-
dc.author.emaile.k.burke@stir.ac.uk-
dc.contributor.affiliationComputing Science and Mathematics-
dc.contributor.affiliationUniversity of Nottingham-
dc.contributor.affiliationUniversity of Nottingham-
dc.contributor.affiliationMasaryk University-
dc.rights.embargoterms2999-12-31-
dc.rights.embargoliftdate2999-12-31-
dc.identifier.isi000281246700007-
Appears in Collections:Computing Science and Mathematics Journal Articles

Files in This Item:
File Description SizeFormat 
A supernodal formulation of vertex colouring with applications in course timetabling.pdf677.19 kBAdobe PDFUnder Permanent Embargo    Request a copy


This item is protected by original copyright



Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.