Simulated Annealing and its problems to color graphs

DOI10.1007/3-540-61680-2_52zbMATH Open1380.90272OpenAlexW1824185257MaRDI QIDQ4595483FDOQ4595483

Rainer Schrader, Andreas Nolte

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)

Cited In (1)

• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

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)