Finding multi-objective supported efficient spanning trees
type: Item
instance of: scholarly article
title: Finding multi-objective supported efficient spanning trees
zbMATH Open document ID: 1469.90128
author: Pedro Correia
author: Luís Paquete
author: José Rui Figueira
published in: Computational Optimization and Applications
publication date: 2021-06-01T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7353235
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: weight-set decomposition
zbMATH Keywords: minimum spanning tree
zbMATH Keywords: neighborhood search
MaRDI profile type: Publication
full work available at URL: s10589-020-00251-6
OpenAlex ID: W3125154412
cites work: Q3056948
cites work: Graphical exploration of the weight space in three-objective mixed integer linear programs
cites work: On bicriterion minimal spanning trees: An approximation
cites work: Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems
cites work: A minimum spanning tree algorithm with inverse-Ackermann type complexity
cites work: Efficient spanning trees
cites work: Multicriteria Optimization
cites work: Connectedness of efficient solutions in multiple criteria combinatorial optimization
cites work: Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
cites work: Proper efficiency and the theory of vector maximization
cites work: Q3075630
cites work: Connectedness of efficient solutions in multiple objective combinatorial optimization
cites work: On spanning tree problems with multiple objectives
cites work: Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
cites work: A randomized linear-time algorithm to find minimum spanning trees
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
cites work: A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
cites work: Dynamic programming for spanning tree problems: application to the multi-objective case
cites work: The problem of the optimal biobjective spanning tree
cites work: A Survey on Multiple Objective Minimum Spanning Tree Problems
cites work: A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
cites work: Computing all efficient solutions of the biobjective minimum spanning tree problem
cites work: Q4001824
cites work: Q4779780
cites work: Spanning Trees and Optimization Problems
cites work: Genetic algorithm approach on multi-criteria minimum spanning tree problem
DOI: 10.1007/S10589-020-00251-6
Recommended article: On spanning tree problems with multiple objectives
Recommended article: Empirical study of exact algorithms for the multi-objective spanning tree
Recommended article: Minimum spanning trees made easier via multi-objective optimization
Recommended article: Q4733693
Recommended article: A new approach for the multiobjective minimum spanning tree
Recommended article: A Survey on Multiple Objective Minimum Spanning Tree Problems
Recommended article: On Possibly Optimal Tradeoffs in Multicriteria Spanning Tree Problems
Recommended article: Dynamic programming for spanning tree problems: application to the multi-objective case
Recommended article: Evolutionary Multi-Criterion Optimization
Recommended article: Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization
description: scientific article; zbMATH DE number 7353235