Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

77

ISAAC
2009
Springer

103views Algorithms» more ISAAC 2009»

An Improved Approximation Algorithm for the Traveling Tournament Problem

15 years 9 months ago

An Improved Approximation Algorithm for the Traveling Tournament Problem

Download www.ism.ac.jp

Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashir

Real-time Traffic

Algorithms | ISAAC 2009 |

claim paper

Related Content

» Heuristics for the mirrored traveling tournament problem

» A simulated annealing and hillclimbing algorithm for the traveling tournament problem

» Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3Cycle Cover Problem...

» Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite T...

» PopulationBased Simulated Annealing for Traveling Tournaments

» A compositeneighborhood tabu search approach to the traveling tournament problem

» Traveling Tournament Scheduling A Systematic Evaluation of Simulated Annealling

» FixedParameter Tractability Results for Feedback Set Problems in Tournaments

» An improved approximation algorithm for the asymmetric TSP with strengthened triangle ineq...

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	ISAAC
Authors	Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui

Comments (0)