✦ LIBER ✦

Tabu Search with Simple Ejection Chains for Coloring Graphs

✍ Scribed by José Luis González-Velarde; Manuel Laguna

Book ID: 110409294
Publisher: Springer US
Year: 2002
Tongue: English
Weight: 88 KB
Volume: 117
Category: Article
ISSN: 0254-5330
DOI: 10.1023/a:1021573507189

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Using tabu search techniques for graph c

Using tabu search techniques for graph coloring

✍ A. Hertz; D. Werra 📂 Article 📅 1987 🏛 Springer Vienna 🌐 English ⚖ 372 KB

Subgraph Ejection Chains and Tabu Search

Subgraph Ejection Chains and Tabu Search for the Crew Scheduling Problem

✍ L. Cavique, C. Rego and I. Themido 📂 Article 📅 1999 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 336 KB

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

Variable neighborhood search with ejecti

Variable neighborhood search with ejection chains for the antibandwidth problem

✍ Manuel Lozano, Abraham Duarte, Francisco Gortázar, Rafael Martí 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 570 KB

STABULUS: A technique for finding stable

STABULUS: A technique for finding stable sets in large graphs with tabu search

✍ C. Friden; A. Hertz; D. Werra 📂 Article 📅 1989 🏛 Springer Vienna 🌐 English ⚖ 508 KB

Comparative Performance of Modified Simu

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

✍ Pal, Anindya Jyoti; Ray, Biman; Zakaria, Nordin; Sarma, Samar Sen 📂 Article 📅 2012 🏛 Elsevier 🌐 English ⚖ 150 KB