Unleashing The Vermin (Vectored Route-Length Minimization)
AbstractWe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by World Scientific Publishing Co. Pte. Ltd. in its journal New Mathematics and Natural Computation.
Volume (Year): 04 (2008)
Issue (Month): 03 ()
Contact details of provider:
Web page: http://www.worldscinet.com/nmnc/nmnc.shtml
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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.