✦ LIBER ✦

A search space “cartography” for guiding graph coloring heuristics

✍ Scribed by Daniel Cosmin Porumbel; Jin-Kao Hao; Pascale Kuntz

Book ID: 111712797
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 317 KB
Volume: 37
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2009.06.024

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

A Range-Compaction Heuristic for Graph C

A Range-Compaction Heuristic for Graph Coloring

✍ Andrea Di Blas; Arun Jagota; Richard Hughey 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 195 KB

A semidefinite programming-based heurist

A semidefinite programming-based heuristic for graph coloring

✍ Igor Dukanovic; Franz Rendl 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 178 KB

Lagrangian relaxation guided problem spa

Lagrangian relaxation guided problem space search heuristics for generalized assignment problems

✍ V. Jeet; E. Kutanoglu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Planning graph as the basis for deriving

Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search

✍ XuanLong Nguyen; Subbarao Kambhampati; Romeo S. Nigenda 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 561 KB

Most recent strides in scaling up planning have centered around two competing themesdisjunctive planners, exemplified by Graphplan, and heuristic state search planners, exemplified by UNPOP, HSP and HSP-r. In this paper, we present a novel approach for successfully harnessing the advantages of the t

A graph coloring constructive hyper-heur

A graph coloring constructive hyper-heuristic for examination timetabling problems

✍ Nasser R. Sabar, Masri Ayob, Rong Qu, Graham Kendall 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 450 KB