Person:
Ramos Domínguez, Rosa María

Profile Picture
First Name
Rosa María
Last Name
Ramos Domínguez
URI
https://hdl.handle.net/20.500.14352/81589
Affiliation
Universidad Complutense de Madrid
Faculty / Institute
Ciencias Matemáticas
Department
Estadística e Investigación Operativa
Area
Estadística e Investigación Operativa
Identifiers
UCM identifierScopus Author IDDialnet ID

Filters

19981
Reset filters

Settings

Author: Alonso, S. ×

Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    Item
    The problem of the optimal biobjective spanning tree
    (European journal of operational research, 1998) Ramos Domínguez, Rosa María; Alonso, S.; Sicilia, J.; González, C.
    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.