A branch-and-cut algorithm for the profitable windy rural postman problem.
Thais ÁvilaAngel CorberánIsaac PlanaJosé M. SanchisPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- learning algorithm
- experimental evaluation
- detection algorithm
- routing problem
- improved algorithm
- objective function
- computational complexity
- computational cost
- significant improvement
- expectation maximization
- worst case
- data sets
- search space
- preprocessing
- k means
- cost function
- clustering method
- particle swarm optimization
- computationally efficient
- recognition algorithm
- probabilistic model
- experimental study
- matching algorithm
- convex hull
- benchmark problems
- optimization algorithm
- segmentation algorithm
- theoretical analysis
- simulated annealing
- np hard
- data streams
- reinforcement learning
- similarity measure
- image sequences
- genetic algorithm
- neural network