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-lenght 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.
Volume (Year): 04 (2008)
Issue (Month): 03 ()
|Contact details of provider:|| Web page: http://www.worldscinet.com/nmnc/nmnc.shtml|
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:wsi:nmncxx:v:04:y:2008:i:03:p:267-272. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim)
If references are entirely missing, you can add them using this form.