A Large Neighborhood Search Heuristic for Graph Coloring

Authors:
Michael A. Trick;Hakan Yildiz
Affiliations:
Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA,15213, USA;Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA,15213, USA
Venue:
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2007

Citing 6
Cited 1

Cyclic transfer algorithms for multivehicle routing and scheduling problems

Operations Research
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Fast Approximate Energy Minimization via Graph Cuts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs

SIAM Journal on Optimization
A survey of local search methods for graph coloring

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search

Hybrid metaheuristics in combinatorial optimization: A survey

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new local search heuristic for graph coloring that searches very large neighborhoods. The heuristic is based on solving a MAX-CUT problem at each step. While the MAX-CUT problem is formally hard, fast heuristics that give "good" cuts are available to solve this. We provide computational results on benchmark instances. The proposed approach is based on similar heuristics used in computer vision.