Análisis comparativo de nuevos algoritmos tipo simplex para problemas de caminos mínimos
ISSN: 1130-4723
Year of publication: 2006
Volume: 18
Issue: 1-2
Pages: 61-70
Type: Article
More publications in: Revista de la Academia Canaria de Ciencias: = Folia Canariensis Academiae Scientiarum
Abstract
In this paper a comparative computational analysis of shortest path algorithms is made. The chosen methods have the same computational complexity (the best polynomial strongly bound for the general case) and they have been applied to the same set ofproblems.