Coloring graphs by iterated local search traversing feasible and infeasible solutions
DOI10.1016/J.DAM.2006.07.013zbMATH Open1131.05087OpenAlexW1980032383MaRDI QIDQ2467355FDOQ2467355
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
- Sur le coloriage des graphs
- Some simplified NP-complete graph problems
- Another look at graph coloring via propositional satisfiability
- A branch-and-cut algorithm for graph coloring
- A graph coloring algorithm for large scheduling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- New methods to color the vertices of a graph
- On the hardness of approximating minimization problems
- Hybrid evolutionary algorithms for graph coloring
- Efficient algorithms for finding critical subgraphs
- A Column Generation Approach for Graph Coloring
- Using tabu search techniques for graph coloring
- An introduction to timetabling
- Finding the chromatic number by means of critical graphs
- Chromatic Scheduling and the Chromatic Number Problem
- Genetic and hybrid algorithms for graph coloring
- A Pruning Procedure for Exact Graph Coloring
- Some experiments with simulated annealing for coloring graphs
- Register Allocation in Structured Programs
- An Introduction to Combinatorial Models of Dynamic Storage Allocation
- Iterative coloring extension of a maximum clique
- Graph coloring with adaptive evolutionary algorithms
- CHECKCOL: improved local search for graph coloring
- Constraint propagation in graph coloring
Cited In (11)
- Expected polynomial-time randomized algorithm for graph coloring problem
- Generalised graph colouring by a hybrid of local search and constraint programming
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM
- CsegGraph: a graph colouring instance generator
- A priority-based genetic algorithm for a flexible job shop scheduling problem
- Combinatorial optimization in system configuration design
- Strong valid inequalities for Boolean logical pattern generation
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach
- An exact algorithm with learning for the graph coloring problem
- Three new upper bounds on the chromatic number
- An incremental search heuristic for coloring vertices of a graph
Recommendations
- Title not available (Why is that?) 👍 👎
- A survey of local search methods for graph coloring 👍 👎
- Generalised graph colouring by a hybrid of local search and constraint programming 👍 👎
- On local search for the generalized graph coloring problem 👍 👎
- CHECKCOL: improved local search for graph coloring 👍 👎
- Feasible Graphs and Colorings 👍 👎
- Iterated local search with tabu search for the weighted vertex coloring problem 👍 👎
- Analysis of an Iterated Local Search Algorithm for Vertex Coloring 👍 👎
- Local optimization of colorings of graphs 👍 👎
This page was built for publication: Coloring graphs by iterated local search traversing feasible and infeasible solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467355)
