Simulated annealing and graph colouring

MaRDI QIDQ2722656zbMATH OpenFDO

Authors Andreas Nolte, Rainer Schrader

Publication date 14 May 2002

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationheuristicsimulated annealingthree-coloring problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Simulated annealing and its problems to color graphs
• Some experiments with simulated annealing for coloring graphs
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Publication:4862247
• scientific article; zbMATH DE number 1264422

Cited in

(6)

• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Simulated annealing and its problems to color graphs
• scientific article; zbMATH DE number 2166875 (Why is no real title available?)
• scientific article; zbMATH DE number 842026 (Why is no real title available?)
• Some experiments with simulated annealing for coloring graphs
• Graph minors from simulated annealing for annealing machines with sparse connectivity

This page was built for publication: Simulated annealing and graph colouring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2722656)