Travelling Salesman Relaxation

From: markus_swartz@xxxxxxxxx
Date: 13 Jul 2006 05:20:06 -0700

Hello,

Can anybody suggest (and describe) a simple relaxation to the
travelling salesman problem?

I'm only interested in solving small instances and intend to use a
branch-and-bound algorithm.

Regards,
--markus

.

Follow-Ups:
- Re: Travelling Salesman Relaxation
  - From: Herbert Glarner

Prev by Date: Re: Mapping rationals to binary strings while preserving order
Next by Date: Re: How slow is O(n^2) ?
Previous by thread: Military logistic problem
Next by thread: Re: Travelling Salesman Relaxation
Index(es):
- Date
- Thread