aboutsummaryrefslogtreecommitdiffstats
path: root/test/ccured_olden/tsp/README
diff options
context:
space:
mode:
Diffstat (limited to 'test/ccured_olden/tsp/README')
-rw-r--r--test/ccured_olden/tsp/README22
1 files changed, 0 insertions, 22 deletions
diff --git a/test/ccured_olden/tsp/README b/test/ccured_olden/tsp/README
deleted file mode 100644
index 29e34d88..00000000
--- a/test/ccured_olden/tsp/README
+++ /dev/null
@@ -1,22 +0,0 @@
-/* For copyright information, see olden_v1.01/COPYRIGHT */
-**********************
-olden_v1.01/benchmarks/tsp/README
-June 1996
-Martin C. Carlisle
-
-this directory contains the Traveling Salesman benchmark:
-
-Adapted for Olden from code by J. Muller using algorithm by:
-
-R. Karp, "Probabilistic analysis of partitioning algorithms for the traveling-
-salesman problem in the plane." Mathematics of Operations Research
-2(3):209-224, August 1977
-
-**********************
-
-Makefile - use "make tsp" to create executable
-
-args.c - process command line args
-build.c - build cities tree
-tsp.[ch] - compute tsp
-main.c - main routine