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...
Saved in:
Main Authors: | LIM, Andrew, ZHU, Yi, LOU, Q., RODRIGUES, Brian |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2005
|
Subjects: | |
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 |
Similar Items
-
A New Heuristic Method for the Bandwidth Minimization Problem
by: LIM, Andrew, et al.
Published: (2003) -
Heuristics for a Brokering Set Packing Problem
by: GUO, Yunso, et al.
Published: (2004) -
Using a Lagrangian Heuristic for a Combinatorial Auction Problem
by: GUO, Yunsong, et al.
Published: (2005) -
Heuristics for a Bidding Problem
by: GUO, Yunsong, et al.
Published: (2006) -
New Heuristics for Over-Constrained Flight to Gate Assignments
by: DING, Huping, et al.
Published: (2004)