Sciweavers

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

36

EOR
2006

favoriteEmaildiscussreport

97views more EOR 2006»

A simulated annealing and hill-climbing algorithm for the traveling tournament problem

13 years 11 months ago

A simulated annealing and hill-climbing algorithm for the traveling tournament problem

Download www.stanford.edu

The Traveling Tournament Problem (TTP) [E. Easton, G. Nemhauser, M. Trick, The traveling tournament problem description and benchmarks, in: Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, CP 2001, 2001, pp. 580

Andrew Lim, Brian Rodrigues, X. Zhang

Real-time Traffic

Double Round-robin Tournament | EOR 2006 | Tournament Problem Description | Tournament Problems |

claim paper

Related Content

» Getting What You Pay For Is Exploration in Distributed Hill Climbing Really Worth it

» PopulationBased Simulated Annealing for Traveling Tournaments

» Traveling Tournament Scheduling A Systematic Evaluation of Simulated Annealling

» Highest Utility First Search Across Multiple Levels of Stochastic Design

» Using Combinatorial Optimization Methods for Quantification Scheduling

» Finding Balanced Incomplete Block Designs with Metaheuristics

» A Comparison of Techniques for Scheduling Earth Observing Satellites

» A smart hillclimbing algorithm for application server configuration

» Onetestatatime heuristic search for interaction test suites

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	EOR
Authors	Andrew Lim, Brian Rodrigues, X. Zhang

Comments (0)