✦ LIBER ✦

A complete search method for the relaxed traveling tournament problem

✍ Scribed by Filipe Brandão, João Pedro Pedroso

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A 5.875-approximation for the Traveling

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

A combined local search and integer prog

✍ Goerigk, Marc; Westphal, Stephan 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 218 KB

A 2.75-approximation algorithm for the u

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

A search algorithm for the traveling sal

✍ Jatinder N.D. Gupta 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 713 KB

A simulated annealing and hill-climbing

✍ A. Lim; B. Rodrigues; X. Zhang 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Decomposition and local search based met

✍ Wauters, Tony; Van Malderen, Sam; Vanden Berghe, Greet 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 512 KB