Vectored Route-length Minimization - A Heuristic and An Open Conjecture

Details Vectored Route-length Minimization - A Heuristic and An Open Conjecture Vectored Route-length Minimization - A Heuristic and An Open Conjecture

2008-02-13

arxiv.org/abs/0802.1912v2

New Mathematics and Natural Computing (World Scientific), Vol. 4, No. 3, 267-272, 2008.

Mathematics

General Mathematics

7 pages

Scientific paper

We propose a simple but interesting graph theoretic problem and posited a heuristic solution procedure, which we have christened as Vectored Route-length Minimization Search (VeRMinS). Basically, it constitutes of a re-casting of the classical 'shortest route' problem within a strictly Euclidean space. We have only presented a heuristic solution process with the hope that a formal proof will eventually emerge as the problem receives wider exposure within mathematical circles.

Affiliated with

Also associated with

No associations

Rating

Vectored Route-length Minimization - A Heuristic and An Open Conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Vectored Route-length Minimization - A Heuristic and An Open Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Vectored Route-length Minimization - A Heuristic and An Open Conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-681874