Universidad Complutense de Madrid
E-Prints Complutense

The problem of the optimal biobjective spanning tree

Impacto

Descargas

Último año

Ramos Domínguez, Rosa María y Alonso, S. y Sicilia, J. y González, C. (1998) The problem of the optimal biobjective spanning tree. European journal of operational research, 111 (3). pp. 617-628. ISSN 0377-2217

[img] PDF
Restringido a Sólo personal autorizado del repositorio

254kB

URL Oficial: http://www.sciencedirect.com/science/article/pii/S0377221797003913


URLTipo de URL
http://www.sciencedirect.com/Editorial


Resumen

This paper studies the problem of finding the set of optimal spanning trees of a connected graph, considering two cost functions defined on the set of edges. This problem is NP-hard and the solution is described through an algorithm that builds the family of efficient trees. This algorithm needs two procedures that solve the following uniobjective problems: the construction of all the spanning trees of a connected graph and the construction of the whole set of minimum cost spanning trees. The computational results obtained are shown in Section 5. (C) 1998 Elsevier Science B.V. All rights reserved.


Tipo de documento:Artículo
Palabras clave:Multi-criteria analysis; Spanning tree; Minimum cost spanning tree; Biobjective optimal cost spanning tree ; Graphs
Materias:Ciencias > Matemáticas > Investigación operativa
Código ID:17604
Depositado:10 Ene 2013 09:32
Última Modificación:18 Jul 2018 10:12

Descargas en el último año

Sólo personal del repositorio: página de control del artículo