Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Guide to Graph ColouringDesigning Seating Plans

A Guide to Graph Colouring: Designing Seating Plans [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.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Guide to Graph ColouringDesigning Seating Plans

Download PDF
16 pages

Loading next page...
 
/lp/springer-journals/a-guide-to-graph-colouring-designing-seating-plans-HAZJ4J6oD9
Publisher
Springer International Publishing
Copyright
© Springer International Publishing Switzerland 2016
ISBN
978-3-319-25728-0
Pages
151 –167
DOI
10.1007/978-3-319-25730-3_6
Publisher site
See Chapter on Publisher Site

Abstract

[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.]

Published: Oct 27, 2015

Keywords: Integer Programming; Tabu Search; Hamiltonian Cycle; Soft Constraint; Hard Constraint

There are no references for this article.