✦ LIBER ✦

Metaheuristics for robust graph coloring

✍ Scribed by Fan Wang, Zhou Xu

Book ID: 120966874
Publisher: Springer US
Year: 2011
Tongue: English
Weight: 695 KB
Volume: 19
Category: Article
ISSN: 1381-1231
DOI: 10.1007/s10732-011-9180-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-price algorithm for the rob

A branch-and-price algorithm for the robust graph coloring problem

✍ Archetti, Claudia; Bianchessi, Nicola; Hertz, Alain 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 445 KB

Metaheuristics for Production Scheduling

Metaheuristics for Production Scheduling (Jarboui/Metaheuristics for Production Scheduling) || Models and Methods in Graph Coloration for Various Production Problems

✍ Jarboui, Bassem; Siarry, Patrick; Teghem, Jacques 📂 Article 📅 2013 🏛 John Wiley & Sons, Inc. ⚖ 266 KB

Hybrid Evolutionary Algorithms for Graph

Hybrid Evolutionary Algorithms for Graph Coloring

✍ Philippe Galinier; Jin-Kao Hao 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 101 KB

Strengthening the Lovászbound for graph

Strengthening the Lovászbound for graph coloring

✍ Philippe Meurdesoif 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 299 KB

Graph coloring bounds for cellular radio

✍ Pierre Baldi; Edward C. Posner 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 321 KB

A graph coloring problem usdul in deciding whether a set of call requests in cellular radio is compatible with frequency use constraints is introduced. Lower and upper bounds are obtained for the hexagonal cell case typical of raany urban cellular systems. These bounds are on the number of frequenci

Learning classifier system for graph col

Learning classifier system for graph coloring

✍ Zoheir Ezziane 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 691 KB