A cycle with minimum length
- From: "Mahdi" <mahdi.dabestani@xxxxxxxxx>
- Date: 30 Mar 2007 11:22:10 -0700
Hello everyone!
We have n points in a chart that none of them have the same length(I
mean their 'x' parameter). We want to find a cycle with MINIMUM length
with these assumptions : We start from the point with minimum length,
meeting all of the points and finally return to the starting point. We
are allowed to change our direction of moving only one time. I mean we
go through more positive points seeing some of them, and when we
arrive to the rightest point, we change our direction to the left, and
seeing reminding points, return to the starting point. Let me give an
example: We have 3 points a,b,c :
a : x=2 y=0
b: x=10 y=8
c: x=17 y=0
one possible cycle is : a-->b-->c-->a
another : a-->c-->b-->a
One of them is shorter than the another.
thanks.
.
- Prev by Date: Re: My LP Formulation of the TSP: Conclusions
- Next by Date: Longest path
- Previous by thread: Is it possible to generate a context-free grammar for a programming language?
- Next by thread: Longest path
- Index(es):
Relevant Pages
|
