Added results for C316k.0 for several of the Johnson-McGeoch local optimization implementations. Also added a cgi-script to automatically generate a summary table for each algorithm, so that results for similarly sized instances from each class can be more readily compared. Added results for a variety of additional tour construction heuristics implemented by Bentley, Johnson, and McGeoch. Ralf Keuthen for algorithms Hyperopt and Variable Neighborhood Search Hyperopt. Martin Zachariasen for various Zachariasen-Dam implementations of Tabu Search.
Former homepage is now about.html .
Extended the deadline for inclusion in the initial technical report until November 30, 2000. Added .pdf version of the viewgraphs for David Johnson's talk about the Challenge at the 2000 International Symposium on Mathematical Programming. If correctly generated, the instance should consist of 6459637 bytes. We will shortly add results for this instance to the data for Johnson-McGeoch codes that can handle instances this large. Participants who have already submitted data and want to include this instance as well can send results for the instance alone if run on the same machine as your other results, and we will add them to your data files.