This textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. The author describes and analyses some of the best-known algorithms for colouring graphs, focusing on whether these heuristics can provide optimal solutions in some cases; how they perform on graphs where the chromatic number is unknown; and whether they can produce better solutions than other algorithms for certain types of graphs, and why.
The introductory chapters explain graph colouring, complexity theory, bounds and constructive algorithms. The author then shows how advanced, graph colouring techniques can be applied to classic real-world operational research problems such as designing seating plans, sports scheduling, and university timetabling. He includes many examples, suggestions for further reading, and historical notes, and the book is supplemented by an online suite of downloadable code.
The book is of value to researchers, graduate students, and practitioners in the areas of operations research, theoretical computer science, optimization, and computational intelligence. The reader should have elementary knowledge of sets, matrices, and enumerative combinatorics.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Dr. Rhyd Lewis is a reader in operational research at Cardiff School of Mathematics, Cardiff University. Previously, he was a lecturer in quantitative methods at Cardiff Business School. He holds a Ph.D. in Computer Science and Operational Research from Edinburgh Napier University. His research interests cover algorithmic graph theory and the analysis and application of metaheuristic algorithms. He is a cofounder and associate editor of the Intl. J. of Metaheuristics.
This unique textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications.
The work describes and analyses some of the best-known algorithms for colouring graphs, focusing on: whether these heuristics can provide optimal solutions in some cases; how they perform on graphs where the chromatic number is unknown; and whether they can produce better solutions than other algorithms for certain types of graphs, and why.
Introductory chapters explain graph colouring, complexity theory, bounds and constructive algorithms. Further exposition then shows how advanced graph-colouring techniques can be applied to classic real-world operational research problems, such as designing seating plans, sports scheduling, and university timetabling. Readers should have elementary knowledge of sets, matrices, and enumerative combinatorics.
Topics and features:
This fine new edition will be of real value to graduate students, researchers, and practitioners in the areas of operations research, theoretical computer science, optimization, and computational intelligence. It thus will fulfill a dual role as both a key textbook for academia and a guidebook for professional self-study and pursuits.
Dr. Rhyd Lewis is a reader in operational research at Cardiff School of Mathematics, Cardiff University, UK. Previously he was a lecturer in quantitative methods at Cardiff Business School.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Ihre gesetzlichen Garantierechte: Alle Verbraucher:innen in der EU profitieren von mindestens 2 Jahren gesetzlichem Garantieschutz für alle in der EU verkauften Konsumgüter. Mehr erfahren
Anbieter: WeBuyBooks, Rossendale, LANCS, Vereinigtes Königreich
paperback. Zustand: Like New. Most items will be dispatched the same or the next working day. An apparently unread copy in perfect condition. Dust cover is intact with no nicks or tears. Spine has no signs of creasing. Pages are clean and not marred by notes or folds of any kind. Artikel-Nr. rev1732771256
Anzahl: 1 verfügbar
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. Artikel-Nr. 401170211
Anzahl: 1 verfügbar
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. Artikel-Nr. 18396288246
Anzahl: 1 verfügbar
Anbieter: California Books, Miami, FL, USA
Zustand: New. Artikel-Nr. I-9783030810566
Anzahl: Mehr als 20 verfügbar
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Zustand: New. Artikel-Nr. 44925252-n
Anzahl: Mehr als 20 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In English. Artikel-Nr. ria9783030810566_new
Anzahl: Mehr als 20 verfügbar
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Zustand: As New. Unread book in perfect condition. Artikel-Nr. 44925252
Anzahl: Mehr als 20 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Paperback. Zustand: Brand New. 2nd edition. 318 pages. 9.25x6.10x0.98 inches. In Stock. Artikel-Nr. x-3030810569
Anzahl: 2 verfügbar
Anbieter: AussieBookSeller, Truganina, VIC, Australien
Paperback. Zustand: new. Paperback. This textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. The author describes and analyses some of the best-known algorithms for colouring graphs, focusing on whether these heuristics can provide optimal solutions in some cases; how they perform on graphs where the chromatic number is unknown; and whether they can produce better solutions than other algorithms for certain types of graphs, and why. The introductory chapters explain graph colouring, complexity theory, bounds and constructive algorithms. The author then shows how advanced, graph colouring techniques can be applied to classic real-world operational research problems such as designing seating plans, sports scheduling, and university timetabling. He includes many examples, suggestions for further reading, and historical notes, and the book is supplemented by an online suite of downloadable code. The book is of value to researchers, graduate students, and practitioners in the areas of operations research, theoretical computer science, optimization, and computational intelligence. The reader should have elementary knowledge of sets, matrices, and enumerative combinatorics. This textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. and whether they can produce better solutions than other algorithms for certain types of graphs, and why. The introductory chapters explain graph colouring, complexity theory, bounds and constructive algorithms. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Artikel-Nr. 9783030810566
Anzahl: 1 verfügbar