✦ LIBER ✦

Solving the traveling tournament problem with iterative-deepening A∗

✍ Scribed by David C. Uthus, Patricia J. Riddle, Hans W. Guesgen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The traveling tournament problem with pr

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

A 5.875-approximation for the Traveling

✍ Stephan Westphal,Karl Noparlik 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 503 KB

A simulated annealing approach to the tr

✍ A. Anagnostopoulos; L. Michel; P. Van Hentenryck; Y. Vergados 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 421 KB

A complete search method for the relaxed

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

A 2.75-approximation algorithm for the u

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

An ILS heuristic for the traveling tourn

✍ Fabrício N. Costa; Sebastián Urrutia; Celso C. Ribeiro 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 454 KB