scientific article; zbMATH DE number 1488073
From MaRDI portal
Publication:4495173
zbMath0972.90061MaRDI QIDQ4495173
Publication date: 21 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Search theory (90B40) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
A systematic study on meta-heuristic approaches for solving the graph coloring problem ⋮ Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems ⋮ Graph multi-coloring for a job scheduling application ⋮ Multi-coloring and job-scheduling with assignment and incompatibility costs ⋮ Coloring graphs by iterated local search traversing feasible and infeasible solutions ⋮ An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring ⋮ Improving the extraction and expansion method for large graph coloring ⋮ Combinatorial optimization in system configuration design ⋮ A search space ``cartography for guiding graph coloring heuristics ⋮ A memetic algorithm for graph coloring ⋮ An unconstrained quadratic binary programming approach to the vertex coloring problem
This page was built for publication:
