✦ LIBER ✦

The mutual exclusion scheduling problem for permutation and comparability graphs

✍ Scribed by Klaus Jansen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound procedure for the ree

✍ Jen-Shiang Chen 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 184 KB

A simple and effective iterated greedy a

✍ Rubén Ruiz; Thomas Stützle 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 485 KB

Sequential and parallel algorithms for t

✍ Ming-Shing Yu; Lin Yu Tseng; Shoe-Jane Chang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 428 KB

Efficient algorithms for the maximum wei

✍ Maw-Shang Chang; Fu-Hsing Wang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 246 KB

Comparative evaluation of heuristic algo

✍ Jatinder N. D. Gupta 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 740 KB