Re: Discussion about transformation TSP to UniqueTSP
- From: "mathisart" <artrigue@xxxxxxxxx>
- Date: 27 Nov 2006 10:08:42 -0800
(if duble post I am sorry, this did not post correctly 30 minutes later
for my reader)
mathisart wrote:
Rados³aw Hofman wrote:
I think I read somewhere that a TSP with different costs for edge{a,b}
and edge{b,a} can be reduced to a (larger) TSP with edge{a,b} =
edge{b,a}. This limits the right side of the equality-relation in
min() to the factorial of the vertices.
if that reduction is correct, this actually solves for N in TSPs where
edge costs can be derived only from the coordinates of the vertices on
a plane.
.
- References:
- Discussion about transformation TSP to UniqueTSP
- From: Radosław Hofman
- Re: Discussion about transformation TSP to UniqueTSP
- From: mathisart
- Discussion about transformation TSP to UniqueTSP
- Prev by Date: Re: Discussion about transformation TSP to UniqueTSP
- Next by Date: Re: Water surface in hexahedron
- Previous by thread: Re: Discussion about transformation TSP to UniqueTSP
- Next by thread: New thred of discussion about Mr. Diaby's algorithm
- Index(es):