scientific article; zbMATH DE number 2086445

zbMath1054.68649MaRDI QIDQ4736905

Jin-Kao Hao, Jean-Philippe Hamiez

Publication date: 11 August 2004

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (12)

A memetic algorithm for the minimum sum coloring problem ⋮ A graph coloring heuristic using partial solutions and a reactive tabu scheme ⋮ Coloring large graphs based on independent set extraction ⋮ An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring ⋮ Improving the extraction and expansion method for large graph coloring ⋮ A two-phase approach for jointly determining the lot size and delivery policy in a vendor-buyer integrated system with rework ⋮ Graph coloring by multiagent fusion search ⋮ On a parallel genetic-tabu search based algorithm for solving the graph colouring problem ⋮ A memetic algorithm for graph coloring ⋮ Scatter search --- wellsprings and challenges ⋮ Scatter search for the vehicle routing problem with time windows ⋮ Scatter search for project scheduling with resource availability cost

This page was built for publication: