Deakin University
Browse

File(s) under permanent embargo

Unleashing the vermin : vectored route-length minimization

journal contribution
posted on 2008-11-01, 00:00 authored by F Smarandache, Sukanto BhattacharyaSukanto Bhattacharya
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.

History

Journal

New mathematics and natural computation

Volume

4

Issue

3

Pagination

267 - 272

Publisher

World Scientific Publishing Company

Location

Singapore

ISSN

1793-0057

Language

eng

Publication classification

C1.1 Refereed article in a scholarly journal

Copyright notice

2008, World Scientific Publishing Company