The problem of the optimal biobjective spanning tree
type: Item
instance of: scholarly article
title: The problem of the optimal biobjective spanning tree
zbMATH Open document ID: 0937.90112
DOI: 10.1016/S0377-2217(97)00391-3
author: R. M. Ramos
author: Sergio Fernando Alonso Rodríguez
author: Joaquín Sicilia Rodríguez
author: C. González-Martín
published in: European Journal of Operational Research
publication date: 1999-11-08T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 1358447
zbMATH Keywords: multi-criteria analysis
zbMATH Keywords: spanning tree
zbMATH Keywords: minimum cost spanning tree
zbMATH Keywords: biobjective optimal cost spanning tree
MaRDI profile type: Publication
cites work: Q3056948
cites work: Efficient spanning trees
cites work: Q4226179
cites work: Finding All Spanning Trees of Directed and Undirected Graphs
cites work: On the History of the Minimum Spanning Tree Problem
cites work: On spanning tree problems with multiple objectives
cites work: Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
cites work: EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
cites work: An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
cites work: Q3707420
cites work: Structure of Efficient Sets for Convex Objectives
full work available at URL: s0377-2217(97)00391-3
OpenAlex ID: W1985130949
description: scientific article; zbMATH DE number 1358447