Simulated annealing and its problems to color graphs

DOI10.1007/3-540-61680-2_52MaRDI QIDQ4595483zbMATH OpenOpenAlexFDO

Authors Andreas Nolte, Rainer Schrader

Publication date 5 December 2017

Published in Algorithms — ESA '96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61680-2_52

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Simulated annealing and graph colouring
• Convergence and finite-time behavior of simulated annealing
• scientific article; zbMATH DE number 1264422
• Some experiments with simulated annealing for coloring graphs
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

Cited in

(5)

• Simulated annealing and graph colouring
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• scientific article; zbMATH DE number 2166875 (Why is no real title available?)
• scientific article; zbMATH DE number 842026 (Why is no real title available?)
• Coloring in sublinear time

This page was built for publication: Simulated annealing and its problems to color graphs

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