Vectored Route-length Minimization - A Heuristic and An Open Conjecture

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We propose a simple but interesting graph theoretic problem and posited a heuristic solution procedure, which we have christened as Vectored Route-length Minimization Search (VeRMinS). Basically, it constitutes of a re-casting of the classical 'shortest route' problem within a strictly Euclidean space. We have only presented a heuristic solution process with the hope that a formal proof will eventually emerge as the problem receives wider exposure within mathematical circles.
7 pages

Keywords

General Mathematics, 05C38

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/174215

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0802.1912
 http://arxiv.org/abs/0802.1912
 New Mathematics and Natural Computing (World Scientific), Vol. 4, No. 3, 267-272, 2008.

Collections

arXiv