scientific article; zbMATH DE number 2079895

MaRDI QIDQ4472035zbMATH OpenFDO

Authors Luís Paquete, Thomas Stützle

Publication date 3 August 2004

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Coloring graphs by iterated local search traversing feasible and infeasible solutions
• Analysis of an iterated local search algorithm for vertex coloring
• Intensification/diversification-driven ILS for a graph coloring problem
• scientific article; zbMATH DE number 956851
• A survey of local search methods for graph coloring

Cited in

(11)

• Coloring graphs by iterated local search traversing feasible and infeasible solutions
• Population-based iterated greedy algorithm for the S-labeling problem
• A survey of search methodologies and automated system development for examination timetabling
• Intensification/diversification-driven ILS for a graph coloring problem
• A priority-based genetic algorithm for a flexible job shop scheduling problem
• A wide-ranging computational comparison of high-performance graph colouring algorithms
• Local search algorithms for the composite retrieval problem
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• A new model for automated examination timetabling
• An improved ant colony optimisation heuristic for graph colouring
• Analysis of an iterated local search algorithm for vertex coloring

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 Q4472035)