Quantum annealing of the graph coloring problem (Q429697): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2010.12.001 / 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.disopt.2010.12.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003291739 / 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: The Complexity of Near-Optimal Graph Coloring / 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: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / 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: Q2770494 / 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: Hybrid evolutionary algorithms for graph coloring / 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 memetic algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>Colloquium</i>: Quantum annealing and analog quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / 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: Relationship between d-Dimensional Quantal Spin Systems and (d+1)-Dimensional Ising Systems: Equivalence, Critical Exponents and Systematic Approximants of the Partition Function and Spin Correlations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Product of Semi-Groups of Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687262 / 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 heuristic using partial solutions and a reactive tabu scheme / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2010.12.001 / rank
 
Normal rank

Latest revision as of 17:18, 9 December 2024

scientific article
Language Label Description Also known as
English
Quantum annealing of the graph coloring problem
scientific article

    Statements

    Quantum annealing of the graph coloring problem (English)
    0 references
    0 references
    0 references
    20 June 2012
    0 references
    quantum annealing
    0 references
    simulated annealing
    0 references
    graph coloring problem
    0 references
    combinatorial optimization
    0 references

    Identifiers