Ramos Domínguez, Rosa MaríaAlonso, S.Sicilia, J.González, C.2023-06-202023-06-201998-12-160377-221710.1016/S0377-2217https://hdl.handle.net/20.500.14352/57791This 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.engjournal articlehttp://www.sciencedirect.com/science/article/pii/S0377221797003913http://www.sciencedirect.com/restricted access519.8Multi-criteria analysisSpanning treeMinimum cost spanning treeBiobjective optimal cost spanning treeGraphsInvestigación operativa (Matemáticas)1207 Investigación Operativa