| |
| |
Challenge Traveling Tournament Problems |
 | | Feasible Solution: 241973 (Langford, Dec 30 2005), 241264 (Di Gaspero and Schaerf, January 27, 2006), 241214 (Langford, March 13 2006), 238581 (Di Gaspero and Schaerf, March 27, 2006), 237428 (Langford, April 28, 2006). |
 | | Feasible Solution: 361878 (Di Gaspero and Schaerf, Jan 09 2006), 353927 (Langford, Jan 10 2006), 352947 (Di Gaspero and Schaerf, Feb 16 2006), 350256 (Langford, April 24, 2006), 346324 (Langford, April 25, 2006). |
 | | Feasible Solution: 590,497 (Di Gaspero and Schaerf, January 27 2006), 573,596 (Langford, January 27, 2006), 554,670 (Urrutia and Ribeiro, February 10 2006), 551,033 (Langford, June 29 2006). |
| mat.gsia.cmu.edu /TOURN (2235 words) |
|