scientific article; zbMATH DE number 956867
From MaRDI portal
Publication:5687276
zbMath0864.90118MaRDI QIDQ5687276
Charles Fleurent, Jacques A. Ferland
Publication date: 11 December 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Boolean programming (90C09)
Related Items (16)
Bounding vertex coloring by truncatedmultistage branch and bound ⋮ A review on algorithms for maximum clique problems ⋮ Iterative coloring extension of a maximum clique ⋮ An adaptive multistart tabu search approach to solve the maximum clique problem ⋮ Autonomous operator management for evolutionary algorithms ⋮ A hybrid metaheuristic approach to solving the UBQP problem ⋮ A variable neighborhood search for graph coloring. ⋮ An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem ⋮ Embedding a novel objective function in a two-phased local search for robust vertex coloring ⋮ A new \textsf{DSATUR}-based algorithm for exact vertex coloring ⋮ An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring ⋮ Scheduling using tabu search methods with intensification and diversification ⋮ Improving the extraction and expansion method for large graph coloring ⋮ Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering ⋮ A memetic algorithm for graph coloring ⋮ INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING
This page was built for publication:
