Coloring graphs by iterated local search traversing feasible and infeasible solutions
From MaRDI portal
Publication:2467355
DOI10.1016/j.dam.2006.07.013zbMath1131.05087OpenAlexW1980032383MaRDI QIDQ2467355
Paolo Dell'Olmo, Massimiliano Caramia
Publication date: 21 January 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.07.013
Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
A priority-based genetic algorithm for a flexible job shop scheduling problem ⋮ An exact algorithm with learning for the graph coloring problem ⋮ Strong valid inequalities for Boolean logical pattern generation ⋮ A NEW APPROACH TO THE VERTEX COLORING PROBLEM ⋮ Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach ⋮ An incremental search heuristic for coloring vertices of a graph ⋮ CsegGraph: a graph colouring instance generator ⋮ Combinatorial optimization in system configuration design ⋮ Three new upper bounds on the chromatic number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Some simplified NP-complete graph problems
- Graph coloring with adaptive evolutionary algorithms
- Genetic and hybrid algorithms for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- CHECKCOL: improved local search for graph coloring
- Another look at graph coloring via propositional satisfiability
- Efficient algorithms for finding critical subgraphs
- A branch-and-cut algorithm for graph coloring
- An Introduction to Combinatorial Models of Dynamic Storage Allocation
- A graph coloring algorithm for large scheduling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- A Pruning Procedure for Exact Graph Coloring
- New methods to color the vertices of a graph
- Register Allocation in Structured Programs
- A Column Generation Approach for Graph Coloring
- Iterative coloring extension of a maximum clique
- On the hardness of approximating minimization problems
- Finding the chromatic number by means of critical graphs
- Chromatic Scheduling and the Chromatic Number Problem
- Sur le coloriage des graphs
- Constraint propagation in graph coloring
This page was built for publication: Coloring graphs by iterated local search traversing feasible and infeasible solutions
