Re: Travelling Salesman Relaxation
- From: Herbert Glarner <herbert.glarner@xxxxxxxxxx>
- Date: Thu, 13 Jul 2006 18:12:22 +0200
markus_swartz@xxxxxxxxx wrote:
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.
Maybe this link helps (lists some interesting implementations): http://www.cs.sunysb.edu/~algorith/files/traveling-salesman.shtml
Regards
//Herbert
--
http://herbert.wikispaces.com
.
- References:
- Travelling Salesman Relaxation
- From: markus_swartz
- Travelling Salesman Relaxation
- Prev by Date: Re: How slow is O(n^2) ?
- Next by Date: Re: Boolean Query Algorithm
- Previous by thread: Travelling Salesman Relaxation
- Next by thread: List of hard Problems with Transitions from underconstrained to overconstrained
- Index(es):
