Unleashing the vermin : vectored route-length minimization
Smarandache, Florentin and Bhattacharya, Sukanto 2008, Unleashing the vermin : vectored route-length minimization, New mathematics and natural computation, vol. 4, no. 3, pp. 267-272.
Attached Files
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
Name
Description
MIMEType
Size
Downloads
Title
Unleashing the vermin : vectored route-length minimization
We have posed a simple but interesting graph theoretic problem and posited a heuristic solution procedure, which we have christened as Vectored Route-length Minimization (VeRMin). Basically, it constitutes a re-casting of the classical “shortest route” problem in a strictly Euclidean space. We have presented only a heuristic solution process hoping that a formal proof will eventually emerge as the problem receives wider exposure within mathematical circles.
Language
eng
Field of Research
019999 Mathematical Sciences not elsewhere classified
Socio Economic Objective
970101 Expanding Knowledge in the Mathematical Sciences