𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Using tabu search techniques for graph coloring

✍ Scribed by A. Hertz; D. Werra

Publisher
Springer Vienna
Year
1987
Tongue
English
Weight
372 KB
Volume
39
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Epcot: An efficient procedure for colori
Epcot: An efficient procedure for coloring optimally with Tabu Search
✍ N. Dubois; D. de Werra πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 707 KB

We present an exact procedure for coloring the nodes of s graph with as few colors as possible. The problem o~ deciding whether an arbitrary graph can be colored with k colars is NP-complete. The procedure is based ms an implicit enumm'&tion technique. At some stsgrs of the algorithm heuristic metho

Tabu search for the Steiner problem in g
Tabu search for the Steiner problem in graphs
✍ Celso C. Ribeiro; MaurΓ­cio C. De Souza πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 143 KB πŸ‘ 2 views

Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum-weighted subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe a tabu search algorithm for the Steiner problem in graphs, based o