MARCO GSRC Calibrating Achievable Design: Bookshelf

Traveling Salesman Problem Slot

Work in progress: last updated Mon Dec 16 2002

(see other slots)

Ken Boese, Andrew B. Kahng, Mike Oliver and Tim Walters

Contents

I. Introduction 
II. Data Formats
III.Publicly available instances, solutions and reference performance results
IV. Executable Utilities (converters, generators, statistics browsers, evaluators, constraint verifiers)
V. Optimizers and other non-trivial executables
VI. Common in-memory representations, parsers and other source codes

I. Introduction

This slot gives pointers to various TSP codes, benchmarks, and instance generators.

II. Data Formats

  To come


III. Publicly available instances, solutions and reference performance results

TSPLIB


DIMACS Benchmark Instances


Bill Cook's TSP page

IV. Executable Utilities

To come
V. Optimizers and non-trivial executables 
  To come
VI. Source codes
DIMACS Benchmark Code and Instance Generation Codes


Ken Boese's implementation of the Lin-Kernighan heuristic


Keld Helsgaun's implementation of the Lin-Kernighan heuristic


The Concorde TSP code (Applegate, Bixby, Chvátal, and Cook)

abk@ucsd.edu,oliver@cs.ucla.edu