✦ LIBER ✦

A 5.875-approximation for the Traveling Tournament Problem

✍ Scribed by Stephan Westphal,Karl Noparlik

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation algorithm for the trave

✍ Ryuhei Miyashiro; Tomomi Matsui; Shinji Imahori 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 347 KB

An Improved Approximation Algorithm for

✍ Daisuke Yamaguchi; Shinji Imahori; Ryuhei Miyashiro; Tomomi Matsui 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 481 KB

A 2.75-approximation algorithm for the u

✍ Shinji Imahori,Tomomi Matsui,Ryuhei Miyashiro 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 395 KB

New models for the Mirrored Traveling To

✍ Marco Antonio Moreira de Carvalho; Luiz Antonio Nogueira Lorena 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 257 KB

A complete search method for the relaxed

✍ Filipe Brandão, João Pedro Pedroso 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 205 KB

The traveling tournament problem with pr

✍ Rafael A. Melo; Sebastián Urrutia; Celso C. Ribeiro 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 394 KB