head	1.1;access;symbols	zero-five-zero:1.1	zero-four-seventeen:1.1;locks	neto:1.1; strict;comment	@# @;1.1date	98.10.17.22.15.59;	author neto;	state Exp;branches;next	;desc@DSJ RANDOM edges@1.1log@Release 0.4.17@text@#! /usr/bin/perl -I../script ../script/expt.pl# vi : set ts=4 sw=4:# Driver tables for experiments.## Kinds of lines:# 	"require": earliest version of expt.pl that can run this script.# 	"salt": a number to be mixed with permutation number and instance name#		to derive a random number generator seed.#	"algprefix": used to form algorithm-specific names for output files.# 	"inputdir": directory where the input tsp files are# 	"outputdir": directory where the output files should go# 	"scriptdir": directory where scripts are.# 	"bindir": directory where the lk programs are (lk.deg and lk.no_d).# 	"program": base name of program to run (e.g. lk or lk.single);#		The variations will be appended to this# 	"variations": colon-separated list of things to append to "program" to#		get the main optimizer program.# 	"instance": perform experiments on the named TSP file.#	"permutations": list seeds for permuting cities (0 is identity)#	"lkargs": list of arguments that are always supplied#	"preprocess": list preprocessing command (e.g. for cloning)#		There can be multiple preprocessing commands, for multiple kinds of#		runs## instance line Fields, separated by colons:#  	name of file (without .tsp) in $inputdir#	N, the number of cities in the instance#	option to always use with this instance. (Use -l and -u here)#   (sequence of entries indicating number of iters to run.  #		N is replaced by the number of vertices.)## preprocess line fields, separated by colons:#	the command to run on the file with output piped to reorderer.#	the early suffix to put on instance name when generating output files#	the late suffix to put on instance name when generating output files#require 	0.4.14salt		64738algprefix	wpm.		# Mark weighted perfect matching.inputdir	../dataoutputdir	../exptscriptdir	../scriptbindir		../srcprogram		lklkargs     	-v 50 -S dsort --maxdepth 50 -c nn 20 --matchingpermutations 0:1:2:3:4:5:6:7:8:9variations	.deg:.no_dpreprocess cat   : :  # Empty mod letters.instance dsjr.41.1000:1000:-l optimal 10206.0 : Ninstance dsjr.42.1000:1000:-l optimal 9637.0 : Ninstance dsjr.43.1000:1000:-l optimal 10167.0 : Ninstance dsjr.44.1000:1000:-l optimal 9856.0 : Ninstance dsjr.45.1000:1000:-l optimal 10189.0 : Ninstance dsjr.51.3162:3162:-l optimal 56159.0 : Ninstance dsjr.52.3162:3162:-l optimal 56015.0 : Ninstance dsjr.53.3162:3162:-l optimal 56083.0 : Ninstance dsjr.54.3162:3162:-l optimal 56075.0 : Ninstance dsjr.55.3162:3162:-l optimal 56157.0 : Ninstance dsjr.61.10000:10000:-l optimal 312146.0 : Ninstance dsjr.62.10000:10000:-l optimal 312292.0 : Ninstance dsjr.63.10000:10000:-l optimal 314694.0 : Ninstance dsjr.64.10000:10000:-l optimal 312816.0 : Ninstance dsjr.65.10000:10000:-l optimal 311163.0 : N#instance dsjr.71.31622:31622:-l optimal 1763717.0 : N#instance dsjr.72.31622:31622:-l optimal 1752426.0 : N#instance dsjr.73.31622:31622:-l optimal 1748313.0 : N#instance dsjr.74.31622:31622:-l optimal 1749369.0 : N#instance dsjr.75.31622:31622:-l optimal 1748159.0 : N#instance dsjr.81.100000:100000:-l optimal 9824742.0 : N#instance dsjr.82.100000:100000:-l optimal 9837336.0 : N#instance dsjr.83.100000:100000:-l optimal 9826551.0 : N#instance dsjr.84.100000:100000:-l optimal 9832731.0 : N#instance dsjr.85.100000:100000:-l optimal 9834045.0 : N@