MM Problem 1654

[all at abouthugo.de]

SeqFans,

Rob Pratt asked me to forward his message:

Weitergeleitete Nachricht von Rob Pratt <Rob.Pratt at sas.com> vom
24.03.2004, 00:12:30:

I was one of the solvers listed.  The maximum tour length can be
expressed as floor((N+1)^2/2).  The number of optimal tours is 2(K!)^2
for N = 2K, and K!(K+1)! for N = 2K+1.  (The optimal tours are exactly
those which pass through N/2 on every leg.)
  
Rob Pratt
> 
> 	-----Original Message----- 
> 	From: all at abouthugo.de [mailto:all at abouthugo.de] 
> 	Sent: Tue 3/23/2004 5:34 PM 
> 	To: seqfan at ext.jussieu.fr 
> 	Cc: 
> 	Subject: MM Problem 1654
....