A branch-and-cut algorithm for the hub location and routing problem.
Inmaculada Rodríguez MartínJuan José Salazar GonzálezHande YamanPublished in: Comput. Oper. Res. (2014)
Keyphrases
- routing problem
- computational complexity
- cost function
- simulated annealing
- worst case
- objective function
- binary particle swarm optimization
- optimization algorithm
- real time
- particle swarm optimization
- convergence rate
- benchmark problems
- qos multicast routing
- quantum behaved particle swarm optimization
- knapsack problem
- global optimization
- search space
- genetic algorithm