CHECKCOL: improved local search for graph coloring
From MaRDI portal
Publication:2458929
DOI10.1016/j.jda.2005.03.006zbMath1137.90022OpenAlexW2047668495WikidataQ61609579 ScholiaQ61609579MaRDI QIDQ2458929
Massimiliano Caramia, Giuseppe F. Italiano, Paolo Dell'Olmo
Publication date: 5 November 2007
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2005.03.006
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Coloring graphs by iterated local search traversing feasible and infeasible solutions ⋮ Solving the minimum-weighted coloring problem ⋮ Embedding a novel objective function in a two-phased local search for robust vertex coloring ⋮ A NEW APPROACH TO THE VERTEX COLORING PROBLEM ⋮ Combinatorial optimization in system configuration design
Uses Software
Cites Work
- Using tabu search techniques for graph coloring
- Some experiments with simulated annealing for coloring graphs
- An introduction to timetabling
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
- Some simplified NP-complete graph problems
- Graph coloring with adaptive evolutionary algorithms
- Genetic and hybrid algorithms for graph coloring
- An Introduction to Combinatorial Models of Dynamic Storage Allocation
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Register Allocation in Structured Programs
- On the hardness of approximating minimization problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
