An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
DOI10.1007/S10878-006-9036-2zbMATH Open1125.05098OpenAlexW2157877717WikidataQ59131853 ScholiaQ59131853MaRDI QIDQ2460104FDOQ2460104
Mario Pavone, Vincenzo Cutello, Giuseppe Nicosia
Publication date: 14 November 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9036-2
Recommendations
- scientific article; zbMATH DE number 2013463
- scientific article; zbMATH DE number 1974042
- A randomised heuristical algorithm for estimating the chromatic number of a graph
- New Algorithm for Chromatic Number of Graphs and their Applications
- Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm
Combinatorial optimizationChromatic number problemGraph coloring problemImmune algorithmInformation gain
Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)
Cites Work
- A Mathematical Theory of Communication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probability Theory
- 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?)
- A graph coloring algorithm for large scheduling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Hybrid evolutionary algorithms for graph coloring
- A Column Generation Approach for Graph Coloring
- Title not available (Why is that?)
- An introduction to timetabling
- 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?)
- A still better performance guarantee for approximate graph coloring
- Two novel evolutionary formulations of the graph coloring problem
- Title not available (Why is that?)
- Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm
- Evolutionary Computation in Combinatorial Optimization
- An application of graph coloring to printed circuit testing
- Clonal selection: an immunological algorithm for global optimization over continuous spaces
- Iterative coloring extension of a maximum clique
- Title not available (Why is that?)
- Graph colorings and the axiom of choice
Cited In (6)
- Clonal selection: an immunological algorithm for global optimization over continuous spaces
- Evolutionary Computation in Combinatorial Optimization
- Graph coloring by multiagent fusion search
- On benefits and drawbacks of aging strategies for randomized search heuristics
- Title not available (Why is that?)
- Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
Uses Software
This page was built for publication: An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460104)