Abstract
We present a range of techniques for tackling the problem of finding sets of Mutually Orthogonal Latin Rectangles (MOLR). In particular, we use a construction that allows us to search for solutions of a particular form with much reduced effort, and a seeding heuristic for the MOLR problem that allows a local search approach to find much better solutions than would be possible otherwise. Finally, we use the MOLR solutions found to construct solutions to the social golfer problem that improve the best known number of rounds for 43 instances, by as many as 10 rounds. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Harvey, W., & Winterer, T. (2005). Solving the MOLR and social golfers problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, pp. 286–300). Springer Verlag. https://doi.org/10.1007/11564751_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
