✦ LIBER ✦

Efficient approximation algorithms for the routing open shop problem

✍ Scribed by Chernykh, Ilya; Kononov, Alexander; Sevastyanov, Sergey

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for the paralle

✍ Xiandong Zhang; Steef van de Velde 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 713 KB

Approximation algorithms for a vehicle r

✍ Sven O. Krumke; Sleman Saliba; Tjark Vredeveld; Stephan Westphal 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 403 KB

Constructive heuristic algorithms for th

✍ H. Bräsel; T. Tautenhahn; F. Werner 📂 Article 📅 1993 🏛 Springer Vienna 🌐 English ⚖ 698 KB

A -approximation algorithm for the two-m

✍ Igor Averbakh; Oded Berman; Ilya Chernykh 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 527 KB

Competitive genetic algorithms for the o

✍ Christian Prins 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 170 KB

Efficient Approximation Algorithms for t

✍ Cristina Bazgan; Miklos Santha; Zsolt Tuza 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 117 KB