๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Comparative Performance of Modified Simulated Annealing with Simple Simulated Annealing for Graph Coloring Problem

โœ Scribed by Pal, Anindya Jyoti; Ray, Biman; Zakaria, Nordin; Sarma, Samar Sen

Book ID
118748722
Publisher
Elsevier
Year
2012
Tongue
English
Weight
150 KB
Volume
9
Category
Article
ISSN
1877-0509

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Some experiments with simulated annealin
Some experiments with simulated annealing for coloring graphs
โœ M. Chams; A. Hertz; D. de Werra ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 555 KB

Methods of thermodynamical simulation have been used for several famous combinatorial optimization problems. For graph coloring (i.e. partition of the node set into as few independent sets as possible) we describe a method of simulation. Such an approach is combined with other techniques for graph c

A simulated annealing algorithm with the
A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs
โœ Taichi Kaji; Azuma Ohuchi ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 240 KB

In this paper, we present an approach for ยฎnding a minimum cost partition of the nodes of a directed acyclic graph into subsets of a given size, subject to the constraint that the precedence relationships among the elements are satisยฎed, based on the concept of simulated annealing. Simulated anneali