Designing Seating Plans

Autor:	R. M. R. Lewis
Rok vydání:	2015
Předmět:	symbols.namesake Theoretical computer science Section (archaeology) Computer science Graph colouring symbols Table (database) Enhanced Data Rates for GSM Evolution Hamiltonian path Integer programming Tabu search Task (project management)
Zdroj:	A Guide to Graph Colouring ISBN: 9783319257280 Texts in Computer Science ISBN: 9783030810535
DOI:	10.1007/978-3-319-25730-3_6
Popis:	The three remaining chapters of this book each contain a detailed case study showing how graph colouring methods can be used to successfully tackle important realworld problems. The first of these case studies concerns the task of designing table plans for large parties, which, as we will see, combines elements of the NP-hard (edge) weighted graph colouring problem, the equitable graph colouring problem and the k-partition problem. A user-friendly implementation of the algorithm proposed in this section can also be found online at www.weddingseatplanner.com.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53f9a7aa5d1ce8a255463578074e9723 https://doi.org/10.1007/978-3-319-25730-3_6 Zobrazit plný text záznamu