Optimality conditions in preference-based spanning tree problems
type: Item
instance of: scholarly article
title: Optimality conditions in preference-based spanning tree problems
zbMATH Open document ID: 1163.90791
author: Sergio Alonso
author: Miguel Ángel Domínguez-Ríos
author: Marcos Colebrook
author: Antonio Sedeño-Noda
published in: European Journal of Operational Research
publication date: 2009-06-30T00:00:00Z
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 5571510
zbMATH Keywords: multiple criteria analysis
zbMATH Keywords: preference modelling
zbMATH Keywords: multiobjective spanning tree problems
MaRDI profile type: Publication
full work available at URL: j.ejor.2008.07.042
OpenAlex ID: W2050279115
cites work: Q3056948
cites work: Minimal spanning trees: An empirical investigation of parallel algorithms
cites work: A polynomial algorithm for the multicriteria cent-dian location problem
cites work: Q3619797
cites work: Q5615833
cites work: On the History of the Minimum Spanning Tree Problem
cites work: On spanning tree problems with multiple objectives
cites work: Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: A preference-based approach to spanning trees and shortest paths problems
cites work: The problem of the optimal biobjective spanning tree
cites work: Computing all efficient solutions of the biobjective minimum spanning tree problem
cites work: Genetic algorithm approach on multi-criteria minimum spanning tree problem
DOI: 10.1016/J.EJOR.2008.07.042
description: scientific article; zbMATH DE number 5571510