Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs (Q1922632): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Minimax relations for the partial q-colorings of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods to color the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some experiments with simulated annealing for coloring graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evolutionary Tabu Search Algorithm And The NHL Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: EPCOT: An efficient procedure for coloring optimally with Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing: A tool for operational research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic and hybrid algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: STABULUS: A technique for finding stable sets in large graphs with tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter search and star-paths: Beyond the genetic metaphor / rank
 
Normal rank
Property / cites work
 
Property / cites work: A user's guide to tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially solvable cases for the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using tabu search techniques for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms: Foundations and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution algorithms in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495496 / rank
 
Normal rank

Revision as of 13:22, 24 May 2024

scientific article
Language Label Description Also known as
English
Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
scientific article

    Statements

    Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs (English)
    0 references
    0 references
    0 references
    0 references
    1995
    0 references
    \(q\)-stability number
    0 references
    sequential methods
    0 references
    evolutionary procedure
    0 references
    optimization problems
    0 references
    coloring problems
    0 references
    chromatic number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers