scientific article; zbMATH DE number 2013463

MaRDI QIDQ4436796zbMATH OpenFDO

Authors Giuseppe Nicosia, Mario Pavone, Vincenzo Cutello

Publication date 4 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2723/27230171.htm

zbMATH Keywords

Combinatorial optimizationGraph coloring problemImmune AlgorithmInformation Gain

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99) Programming involving graphs or networks (90C35)

Recommendations

• An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
• An application of a new hybrid genetic algorithm to graph coloring
• Hybrid evolutionary algorithms for graph coloring
• A hybrid algorithm of simulated annealing and tabu search for graph colouring problem
• Genetic and hybrid algorithms for graph coloring

Cited in

(5)

• When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms
• An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
• Design of computer network topologies: a Vroom inspired psychoclonal algorithm
• Parallel Immune System for Graph Coloring
• Clonal selection: an immunological algorithm for global optimization over continuous spaces

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436796)