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

Simple item page
dc.creatorSmarandache, Florentin
dc.creatorBhattacharya, Sukanto
dc.date2008-02-13
dc.date2008-02-14
dc.date.accessioned2026-07-07T10:18:32Z
dc.date.available2026-07-07T10:18:32Z
dc.descriptionWe 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.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/0802.1912
dc.identifierhttp://arxiv.org/abs/0802.1912
dc.identifierNew Mathematics and Natural Computing (World Scientific), Vol. 4, No. 3, 267-272, 2008.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/174215
dc.subjectGeneral Mathematics
dc.subject05C38
dc.titleVectored Route-length Minimization - A Heuristic and An Open Conjecture
dc.typetext

Files

Collections

arXiv