Heuristic Methods for Graph Coloring Problems

Heuristic Methods for Graph Coloring Problems

In this work, the Graph Coloring Problem and its generalizations - the Bandwidth Coloring Problem, the Multicoloring Problem and the Bandwidth Multicoloring Problem - are studied. A Squeaky Wheel Optimization with Tabu Search heuristic is developed and experiments using benchmark geometric test case...

Full description

Saved in:
Bibliographic Details
Main Authors: LIM, Andrew, ZHU, Yi, LOU, Q., RODRIGUES, Brian
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2005
Subjects:
Operations and Supply Chain Management
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/2386
https://doi.org/10.1145/1066677.1066892
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.lkcsb_research-3385
record_format dspace
spelling sg-smu-ink.lkcsb_research-33852010-09-23T12:30:04Z Heuristic Methods for Graph Coloring Problems LIM, Andrew ZHU, Yi LOU, Q. RODRIGUES, Brian In this work, the Graph Coloring Problem and its generalizations - the Bandwidth Coloring Problem, the Multicoloring Problem and the Bandwidth Multicoloring Problem - are studied. A Squeaky Wheel Optimization with Tabu Search heuristic is developed and experiments using benchmark geometric test cases show that the algorithm performs well for these problems and achieves results for the Bandwidth Multicoloring Problem which improve on results obtained by other researchers. 2005-03-15T08:00:00Z text https://ink.library.smu.edu.sg/lkcsb_research/2386 info:doi/10.1145/1066677.1066892 https://doi.org/10.1145/1066677.1066892 Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Operations and Supply Chain Management
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Operations and Supply Chain Management
spellingShingle Operations and Supply Chain Management
LIM, Andrew
ZHU, Yi
LOU, Q.
RODRIGUES, Brian
Heuristic Methods for Graph Coloring Problems
description In this work, the Graph Coloring Problem and its generalizations - the Bandwidth Coloring Problem, the Multicoloring Problem and the Bandwidth Multicoloring Problem - are studied. A Squeaky Wheel Optimization with Tabu Search heuristic is developed and experiments using benchmark geometric test cases show that the algorithm performs well for these problems and achieves results for the Bandwidth Multicoloring Problem which improve on results obtained by other researchers.
format text
author LIM, Andrew
ZHU, Yi
LOU, Q.
RODRIGUES, Brian
author_facet LIM, Andrew
ZHU, Yi
LOU, Q.
RODRIGUES, Brian
author_sort LIM, Andrew
title Heuristic Methods for Graph Coloring Problems
title_short Heuristic Methods for Graph Coloring Problems
title_full Heuristic Methods for Graph Coloring Problems
title_fullStr Heuristic Methods for Graph Coloring Problems
title_full_unstemmed Heuristic Methods for Graph Coloring Problems
title_sort heuristic methods for graph coloring problems
publisher Institutional Knowledge at Singapore Management University
publishDate 2005
url https://ink.library.smu.edu.sg/lkcsb_research/2386
https://doi.org/10.1145/1066677.1066892
_version_ 1770570231687675904

Similar Items