✦ LIBER ✦

A -approximation algorithm for the two-machine routing open-shop problem on a two-node network

✍ Scribed by Igor Averbakh; Oded Berman; Ilya Chernykh

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A 3/2 Algorithm for Two-Machine Open Sho

✍ V. A. Strusevich; A. J. A. van de Waart; R. Dekker 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 118 KB

A polynomial algorithm for a two-machine

✍ Svetlana A. Kravchenko 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 462 KB

A pseudo-polynomial algorithm for a two-

✍ Wieslaw Kubiak 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 273 KB

A({(frac 4 3) -})approximation algorithm

✍ Hatem Hadda 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 288 KB

A polynomial algorithm for the two machi

✍ Peter Brucker 📂 Article 📅 1994 🏛 Springer 🌐 German ⚖ 289 KB

A New Approximation Algorithm for the Ca

✍ Tetsuo Asano; Naoki Katoh; Kazuhiro Kawashima 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 93 KB