A branch-and-cut algorithm for the partitioning-hub location-routing problem.
Daniele CatanzaroÉric GourdinMartine LabbéF. Aykut ÖzsoyPublished in: Comput. Oper. Res. (2011)
Keyphrases
- high accuracy
- learning algorithm
- computational cost
- improved algorithm
- experimental evaluation
- optimization algorithm
- computationally efficient
- significant improvement
- preprocessing
- times faster
- convergence rate
- cost function
- detection algorithm
- optimal solution
- worst case
- similarity measure
- segmentation algorithm
- benchmark problems
- partitioning algorithm
- simulated annealing
- dynamic programming
- k means
- search space
- computational complexity
- maximum likelihood
- particle swarm optimization
- optimization problems
- theoretical analysis
- np hard
- classification algorithm
- path planning
- artificial neural networks
- recognition algorithm
- selection algorithm
- genetic algorithm