Empirical study of exact algorithms for the multi-objective spanning tree.
Islame F. C. FernandesElizabeth Ferreira Gouvea GoldbargSílvia M. D. M. MaiaMarco César GoldbargPublished in: Comput. Optim. Appl. (2020)
Keyphrases
- empirical studies
- exact algorithms
- spanning tree
- multi objective
- minimum cost
- approximation algorithms
- evolutionary algorithm
- knapsack problem
- minimum spanning tree
- exact solution
- vehicle routing problem with time windows
- empirical analysis
- multi objective optimization
- objective function
- combinatorial optimization
- particle swarm optimization
- heuristic methods
- real world data sets
- genetic algorithm
- np hard
- benders decomposition
- combinatorial problems
- minimum spanning trees
- combinatorial optimization problems
- max sat
- weighted graph
- minimum weight
- special case
- minimum total cost
- edge weights
- undirected graph
- np complete
- cellular automata
- lower bound
- constraint satisfaction