Improved lower bounds and exact algorithm for the capacitated arc routing problem.
Enrico BartoliniJean-François CordeauGilbert LaportePublished in: Math. Program. (2013)
Keyphrases
- lower bound
- worst case
- lower and upper bounds
- improved algorithm
- objective function
- computational complexity
- dynamic programming
- detection algorithm
- np hard
- learning algorithm
- computational cost
- cost function
- k means
- brute force
- significant improvement
- probabilistic model
- search space
- particle swarm optimization
- preprocessing
- times faster
- convergence rate
- similarity measure
- memetic algorithm
- neural network
- running times