1. STORRE
  2. Faculty of Natural Sciences
  3. Computing Science and Mathematics
  4. Computing Science and Mathematics Journal Articles
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, Edmunden_UK
dc.contributor.authorMaracek, Jakuben_UK
dc.contributor.authorParkes, Andrew Jen_UK
dc.contributor.authorRudova, Hanaen_UK
dc.date.accessioned2018-02-17T23:32:01Z-
dc.date.available2018-02-17T23:32:01Zen_UK
dc.date.issued2010-09en_UK
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.isoenen_UK
dc.publisherSpringeren_UK
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. https://doi.org/10.1007/s10479-010-0716-zen_UK
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.en_UK
dc.rights.urihttp://www.rioxx.net/licenses/under-embargo-all-rights-reserveden_UK
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-31en_UK
dc.rights.embargoreason[A supernodal formulation of vertex colouring with applications in course timetabling.pdf] The 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.en_UK
dc.identifier.doi10.1007/s10479-010-0716-zen_UK
dc.citation.jtitleAnnals of Operations Researchen_UK
dc.citation.issn1572-9338en_UK
dc.citation.issn0254-5330en_UK
dc.citation.volume179en_UK
dc.citation.issue1en_UK
dc.citation.spage105en_UK
dc.citation.epage130en_UK
dc.citation.publicationstatusPublisheden_UK
dc.citation.peerreviewedRefereeden_UK
dc.type.statusVoR - Version of Recorden_UK
dc.author.emaile.k.burke@stir.ac.uken_UK
dc.contributor.affiliationComputing Science and Mathematics - Divisionen_UK
dc.contributor.affiliationUniversity of Nottinghamen_UK
dc.contributor.affiliationUniversity of Nottinghamen_UK
dc.contributor.affiliationMasaryk Universityen_UK
dc.identifier.isiWOS:000281246700007en_UK
dc.identifier.scopusid2-s2.0-77956056664en_UK
dc.identifier.wtid694869en_UK
dcterms.dateAccepted2010-09-30en_UK
dc.date.filedepositdate2013-07-03en_UK
rioxxterms.typeJournal Article/Reviewen_UK
rioxxterms.versionVoRen_UK
local.rioxx.authorBurke, Edmund|en_UK
local.rioxx.authorMaracek, Jakub|en_UK
local.rioxx.authorParkes, Andrew J|en_UK
local.rioxx.authorRudova, Hana|en_UK
local.rioxx.projectInternal Project|University of Stirling|https://isni.org/isni/0000000122484331en_UK
local.rioxx.freetoreaddate2999-12-31en_UK
local.rioxx.licencehttp://www.rioxx.net/licenses/under-embargo-all-rights-reserved||en_UK
local.rioxx.filenameA supernodal formulation of vertex colouring with applications in course timetabling.pdfen_UK
local.rioxx.filecount1en_UK
local.rioxx.source0254-5330en_UK
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.pdfFulltext - Published Version677.19 kBAdobe PDFUnder Permanent Embargo    Request a copy


This item is protected by original copyright

View License
Show simple item record


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

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/

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.