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
Name Description MIMEType Size Downloads

Title Unleashing the vermin : vectored route-length minimization
Author(s) Smarandache, Florentin
Bhattacharya, Sukanto
Journal name New mathematics and natural computation
Volume number 4
Issue number 3
Start page 267
End page 272
Publisher World Scientific Publishing Company
Place of publication Singapore
Publication date 2008-11
ISSN 1793-0057
Keyword(s) heuristic programming
operations research
artificial intelligence
programming (Mathematics)
mathematical optimization
Euclidean space
graph theory
network connectivity matrix
Summary 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
HERDC Research category C1.1 Refereed article in a scholarly journal
Copyright notice ©2008, World Scientific Publishing Company
Persistent URL http://hdl.handle.net/10536/DRO/DU:30035228

Document type: Journal Article
Collection: Deakin Graduate School of Business
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Access Statistics: 45 Abstract Views, 2 File Downloads  -  Detailed Statistics
Created: Mon, 30 May 2011, 11:04:49 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.