View unanswered posts | View active topics It is currently Mon Dec 11, 2017 4:50 am



Reply to topic  [ 4 posts ] 
 b4 doubt 
Author Message
Junior Member

Joined: Sat Aug 09, 2003 12:35 am
Posts: 5
Post 
suppose pizza dude starts from A
follows A L I G N , now does he need to return to A from N or do we stop him at N, this will affect the distance travelled by him and also the route that he needs to take.


Sat Aug 09, 2003 12:54 am
Report this post
Profile
Junior Member

Joined: Sat Aug 09, 2003 12:35 am
Posts: 5
Post 
also,

suppose we have a direct route from A-B .
will there be a possibility that the there exists routes A-C and C-B such that Distance(A-B) > Distance(A-C) + Distance(C-B)
hence shortest distance from A to B will be via C and not the direct path.

If Distance(A-B) > Distance(A-C) + Distance(C-B) has to be considered then good tours cannot be found in small times.


Sat Aug 09, 2003 1:14 am
Report this post
Profile
Junior Member

Joined: Sat Aug 09, 2003 12:35 am
Posts: 5
Post 
.
.
.
.


Sat Aug 09, 2003 2:45 am
Report this post
Profile
Junior Member

Joined: Sat Aug 09, 2003 12:35 am
Posts: 5
Post 
i just noticed:-
in case we have :-
distance{a,b} > distance{a,c} + distance{c,b}

then in our case P!=NP
hence good tours cannot be found in polynomial time. i.e we will require infinite time => cannot be solved.

=> we must have :-
distance{a,b} <= distance{a,c} + distance{c,b}
for all a,b and c such that
a,c,b belong to list of towns


Sat Aug 09, 2003 3:59 am
Report this post
Profile
Display posts from previous:  Sort by  
Reply to topic   [ 4 posts ] 

Who is online

Users browsing this forum: No registered users and 0 guests


You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum

Search for:
Jump to:  
cron
© Copyright 2003-2008 www.php-editors.com. The ultimate PHP Editor and PHP IDE site.