Empirical study of exact algorithms for the multi-objective spanning tree

DOI10.1007/S10589-019-00154-1zbMATH Open1432.90153OpenAlexW2984307052WikidataQ126800609 ScholiaQ126800609MaRDI QIDQ2301151FDOQ2301151

Elizabeth Ferreira Gouvêa Goldbarg, Marco Cesar Goldbarg, Islame F. C. Fernandes, Silvia M. D. M. Maia

Publication date: 28 February 2020

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-019-00154-1

Recommendations

• A new approach for the multiobjective minimum spanning tree
• A Survey on Multiple Objective Minimum Spanning Tree Problems
• On spanning tree problems with multiple objectives
• Minimum spanning trees made easier via multi-objective optimization
• Publication:4733693

zbMATH Keywords

exact algorithmsspanning treemulti-objective problems

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35)

Cites Work

• Title not available (Why is that?)
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Title not available (Why is that?)
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• A survey and annotated bibliography of multiobjective combinatorial optimization
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
• Finding all nondominated points of multi-objective integer programs
• On spanning tree problems with multiple objectives
• A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
• Title not available (Why is that?)
• Choquet-based optimisation in multiobjective shortest path and spanning tree problems
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• A GRASP algorithm for the multi-criteria minimum spanning tree problem
• The problem of the optimal biobjective spanning tree
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• Efficient spanning trees
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• Minimum-weight spanning tree algorithms. A survey and empirical study
• On bicriterion minimal spanning trees: An approximation
• The multi-criteria minimum spanning tree problem based genetic algorithm
• Optimality conditions in preference-based spanning tree problems
• A preference-based approach to spanning trees and shortest paths problems
• Multi‐objective optimization using metaheuristics: non‐standard algorithms
• A new approach for the multiobjective minimum spanning tree
• A Survey on Multiple Objective Minimum Spanning Tree Problems
• Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm
• Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
• Dynamic programming for spanning tree problems: application to the multi-objective case

Cited In (6)

• Multicriteria path and tree problems: discussion on exact algorithms and applications
• Finding multi-objective supported efficient spanning trees
• Evolutionary Multi-Criterion Optimization
• Biobjective optimization problems on matroids with binary costs
• On solving bi-objective constrained minimum spanning tree problems
• A Survey on Multiple Objective Minimum Spanning Tree Problems

Uses Software

• LEDA
• VRP

This page was built for publication: Empirical study of exact algorithms for the multi-objective spanning tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301151)