✦ LIBER ✦

Measuring instance difficulty for combinatorial optimization problems

✍ Scribed by Kate Smith-Miles; Leo Lopes

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Metaheuristic algorithms for combinatori

✍ Manuel Iori 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 41 KB

Approximation algorithms for combinatori

✍ M. Ehrgott 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 228 KB

Approximation algorithms for combinatori

✍ Matthias Ehrgott 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB

Exponential irreducible neighborhoods fo

✍ Robert T. Firla; Bianca Spille; Robert Weismantel 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 168 KB

On metaheuristic algorithms for combinat

✍ Mutsunori Yagiura; Toshihide Ibaraki 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 2 views

Bound sets for biobjective combinatorial

✍ Matthias Ehrgott; Xavier Gandibleux 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 513 KB