Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2006.07.013 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.07.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980032383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4380372 / 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: Iterative coloring extension of a maximum clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint propagation in graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: CHECKCOL: improved local search for graph coloring / 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: Q4083324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Combinatorial Models of Dynamic Storage Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding critical subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495173 / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the chromatic number by means of critical graphs / 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: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Register Allocation in Structured Programs / 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: Q5687261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach for Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pruning Procedure for Exact Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another look at graph coloring via propositional satisfiability / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2006.07.013 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:58, 18 December 2024

scientific article
Language Label Description Also known as
English
Coloring graphs by iterated local search traversing feasible and infeasible solutions
scientific article

    Statements

    Coloring graphs by iterated local search traversing feasible and infeasible solutions (English)
    0 references
    0 references
    0 references
    21 January 2008
    0 references
    graph coloring benchmarks
    0 references
    heuristics
    0 references
    local search
    0 references
    vertex coloring
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references