Quantum annealing of the graph coloring problem
From MaRDI portal
Publication:429697
DOI10.1016/J.DISOPT.2010.12.001zbMATH Open1244.05097OpenAlexW2003291739MaRDI QIDQ429697FDOQ429697
Olawale Titiloye, Alan Crispin
Publication date: 20 June 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2010.12.001
Recommendations
Cites Work
- Optimization by Simulated Annealing
- A survey of local search methods for graph coloring
- On the Product of Semi-Groups of Operators
- Colloquium: Quantum annealing and analog quantum computation
- 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.
- A graph coloring algorithm for large scheduling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Hybrid evolutionary algorithms for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A memetic algorithm for graph coloring
- Using tabu search techniques for graph coloring
- An adaptive memory algorithm for the \(k\)-coloring problem
- A metaheuristic approach for the vertex coloring problem
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- Title not available (Why is that?)
- The Complexity of Near-Optimal Graph Coloring
- Title not available (Why is that?)
- A Pruning Procedure for Exact Graph Coloring
- Title not available (Why is that?)
- Some experiments with simulated annealing for coloring graphs
Cited In (13)
- Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022
- An extraction and expansion approach for graph coloring
- Improving the extraction and expansion method for large graph coloring
- Some experiments with simulated annealing for coloring graphs
- Quantum approaches to graph colouring
- Large-scale vehicle routing problems: quantum annealing, tunings and results
- A systematic study on meta-heuristic approaches for solving the graph coloring problem
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- An exact algorithm with learning for the graph coloring problem
- Maximum-weight stable sets and safe lower bounds for graph coloring
- An improved noise quantum annealing method for TSP
- Safe Lower Bounds for Graph Coloring
Uses Software
This page was built for publication: Quantum annealing of the graph coloring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429697)
