| T.R | Title | User | Personal
Name | Date | Lines |
|---|
| 811.1 | . . . | KEEPER::KOSTAS | He is great who confers the most benefits. | Tue Jan 05 1988 18:29 | 7 |
| re. .0
Well,
they wont have to travel far if any of these family members
are relatives of the traveling salesman.
/k
|
| 811.2 | Give that man the third degree | SQM::HALLYB | Khan or bust! | Wed Jan 06 1988 14:33 | 4 |
| ... and is this easier or harder than minimizing travel _costs_?
What if there's no restaurant at the minimum-distance point?
Or are there a finite number of restaurants to choose from?
If so, where are they?
|
| 811.3 | | LABC::FRIEDMAN | | Thu Jan 07 1988 14:44 | 3 |
| After finding the minimum-distance point, the closest restaurant
will be chosen, so the problem is merely to find the minimum-distance
point.
|
| 811.4 | Who needs digital computers? | AKQJ10::YARBROUGH | Why is computing so labor intensive? | Thu Jan 07 1988 15:06 | 14 |
| There is a cute analog solution to this problem. Get yourself a map (a
Mercator projection map may not be good enough; the distances and angles
must both be reasonably accurate) and a piece of flat metal or plastic of
the same size. Drill holes in the material corresponding to people's homes
on the map. Through the holes pass (equally) weighted threads; tie all the
threads together above the material in a knot, with the weighted ends of
the threads hanging through the holes. The place on the map where the knot
is stable (won't move away when the whole thing is jiggled) is the point
you seek.
If it turns out that the knot is stable in several places then you have a
case where any point within the convex hull of the locations will do.
Lynn Yarbrough
|