An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem.
Ernando Gomes de SousaAndréa Cynthia SantosDario José AloisePublished in: RAIRO Oper. Res. (2015)
Keyphrases
- bi objective
- multi objective
- efficient solutions
- minimum cost
- spanning tree
- hybrid algorithms
- set covering problem
- interval data
- shortest path problem
- ant colony optimization
- multi objective optimization
- network design
- maximum distance
- evolutionary algorithm
- multiple objectives
- objective function
- knapsack problem
- artificial neural networks
- metaheuristic
- markov chain
- particle swarm optimization
- probability distribution