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

DOI10.1007/S10589-019-00154-1MaRDI QIDQ2301151zbMATH OpenOpenAlexWikidataFDO

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

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

zbMATH Keywords

exact algorithmsspanning treemulti-objective problems

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1368469 (Why is no real title available?)
• scientific article; zbMATH DE number 2102231 (Why is no real title available?)
• A GRASP algorithm for the multi-criteria minimum spanning tree problem
• A Survey on Multiple Objective Minimum Spanning Tree Problems
• 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
• A new approach for the multiobjective minimum spanning tree
• A preference-based approach to spanning trees and shortest paths problems
• A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
• Choquet-based optimisation in multiobjective shortest path and spanning tree problems
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• Dynamic programming for spanning tree problems: application to the multi-objective case
• Efficient spanning trees
• Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Finding all nondominated points of multi-objective integer programs
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• Minimum-weight spanning tree algorithms. A survey and empirical study
• Multi-objective optimization using metaheuristics: non-standard algorithms
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• On bicriterion minimal spanning trees: An approximation
• On spanning tree problems with multiple objectives
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Optimality conditions in preference-based spanning tree problems
• The multi-criteria minimum spanning tree problem based genetic algorithm
• The problem of the optimal biobjective spanning tree

Cited in

(7)

• Multicriteria path and tree problems: discussion on exact algorithms and applications
• Dynamic and static simulated annealing for solving the multi-objective k-minimum spanning tree problem
• 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

Describes a project that uses

Uses Software

• VRP
• LEDA

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)