Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3126069814 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1301.0939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood search for graph coloring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring heuristic using partial solutions and a reactive tabu scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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: Chromatic Scheduling and the Chromatic Number Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph-based hyper-heuristic for educational timetabling problems / 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: Q4012216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a graph-theoretical model for cyclic register allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to evolutionary computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph coloring with adaptive evolutionary algorithms / 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: Hybrid evolutionary algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of local search methods for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive memory algorithm for the \(k\)-coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of graph coloring to printed circuit testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bag rationalisation for a food manufacturer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / 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: Variable space search for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neutrality and self-adaptation / 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: Q5687246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring algorithm for large scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic tabu search for robust fixed channel assignment under dynamic traffic data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Metaheuristic Approach for the Vertex Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on vertex coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomised 3-colouring algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving heuristics for the frequency assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all k-colorable graphs are easy to color / rank
 
Normal rank

Latest revision as of 14:52, 6 July 2024

scientific article
Language Label Description Also known as
English
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
scientific article

    Statements

    Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (English)
    0 references
    0 references
    0 references
    0 references
    28 June 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    graph 3-coloring
    0 references
    constraint satisfaction
    0 references
    local search
    0 references
    evolutionary algorithms
    0 references
    self-adaptation
    0 references
    heuristic genotype-phenotype mapping
    0 references
    swap local search heuiristic
    0 references
    neutral survivor selection operator
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references