UNLEASHING THE VERMIN (VECTORED ROUTE-LENGTH MINIMIZATION)

Florentin Smarandache () and Sukanto Bhattacharya ()
Additional contact information
Florentin Smarandache: Department of Mathematics, The University of New Mexico, Gallup, NM 87301, USA
Sukanto Bhattacharya: UQ Business School, The University of Queensland, QLD 4072, Australia

New Mathematics and Natural Computation (NMNC), 2008, vol. 04, issue 03, 267-272

Abstract: We have posed a simple but interesting graph theoretic problem and posited a heuristic solution procedure, which we have christened asVectoredRoute-lenghtMinimization(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.

Keywords: Graph theory; Euclidean space; network connectivity matrix (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S1793005708001148
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:nmncxx:v:04:y:2008:i:03:n:s1793005708001148

Ordering information: This journal article can be ordered from

DOI: 10.1142/S1793005708001148

Access Statistics for this article

New Mathematics and Natural Computation (NMNC) is currently edited by Paul P Wang

More articles in New Mathematics and Natural Computation (NMNC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().