Finding multi-objective supported efficient spanning trees
From MaRDI portal
Publication:2028494
DOI10.1007/s10589-020-00251-6zbMath1469.90128OpenAlexW3125154412MaRDI QIDQ2028494
Pedro Correia, Luís Paquete, José Rui Figueira
Publication date: 1 June 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-020-00251-6
Related Items
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Graphical exploration of the weight space in three-objective mixed integer linear programs
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- Connectedness of efficient solutions in multiple objective combinatorial optimization
- Efficient spanning trees
- Connectedness of efficient solutions in multiple criteria combinatorial optimization
- On spanning tree problems with multiple objectives
- On bicriterion minimal spanning trees: An approximation
- The problem of the optimal biobjective spanning tree
- Genetic algorithm approach on multi-criteria minimum spanning tree problem
- Dynamic programming for spanning tree problems: application to the multi-objective case
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- Proper efficiency and the theory of vector maximization
- A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
- Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems
- A Survey on Multiple Objective Minimum Spanning Tree Problems
- A randomized linear-time algorithm to find minimum spanning trees
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- Spanning Trees and Optimization Problems
- Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
- Multicriteria Optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item