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.

MoreLess

Year of publication:	2008
Authors:	SMARANDACHE, FLORENTIN ; BHATTACHARYA, SUKANTO
Published in:	New Mathematics and Natural Computation (NMNC). - World Scientific Publishing Co. Pte. Ltd., ISSN 1793-7027. - Vol. 04.2008, 03, p. 267-272
Publisher:	World Scientific Publishing Co. Pte. Ltd.
Subject:	Graph theory \| Euclidean space \| network connectivity matrix

More details

Extent:	application/pdf text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10004977632