Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: traveling salesmen problem
Replies: 4   Last Post: Oct 21, 2012 12:37 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Sterten

Posts: 65
Registered: 12/13/04
Re: traveling salesmen problem
Posted: Oct 20, 2012 10:55 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

seems to be trivial to solve and therefore mathematically
not interesting. Still I think there should be a name and
an algorithm how to find it in internet.E.g. at wikipedia.
I'd call it the pipeline problem.

I think the solution is to repeatedly select the shortest distance
between a connected city and a nonconnected one and connect the two.

Or has someone a counterexample ?

It's not satisfactory for me, though. I want to list the cities
in 1-dim and I wand conglomerations to be listed in one group
and not possibly scattered.
The "subtree grouping problem" ?
Or the "province forming problem" ?
How to assign the cities
from a list to k -to be formed- administrative regions and subregions so the
the sum of distances of cities in the same group is minimal.

given a metric space M and an integer k, find disjoint subsets S1..Sk of
M whose union is M so to minimize SUM(i=1..k)SUM((x,y) in SixSi) d(x,y)

well, I don't know k.



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.