On the Biobjective Adjacent Only Quadratic Spanning Tree Problem.
Sílvia M. D. M. MaiaElizabeth Ferreira Gouvea GoldbargMarco César GoldbargPublished in: Electron. Notes Discret. Math. (2013)
Keyphrases
- bi objective
- efficient solutions
- multi objective
- minimum cost flow
- multi objective optimization
- shortest path problem
- set covering problem
- ant colony optimization
- multiple objectives
- objective function
- spanning tree
- network design
- computational complexity
- pareto local search
- shortest path
- knapsack problem
- minimum spanning tree
- set covering
- particle swarm optimization
- optimal solution