A branch-and-cut algorithm for the Orienteering Arc Routing Problem.
Claudia ArchettiÁngel CorberánIsaac PlanaJosé M. SanchisM. Grazia SperanzaPublished in: Comput. Oper. Res. (2016)
Keyphrases
- cost function
- detection algorithm
- preprocessing
- experimental evaluation
- optimal solution
- search space
- learning algorithm
- computationally efficient
- computational complexity
- improved algorithm
- theoretical analysis
- simulated annealing
- optimization algorithm
- np hard
- classification algorithm
- experimental study
- path planning
- convex hull
- recognition algorithm
- mobile robot
- image compression
- input data
- linear programming
- worst case
- dynamic programming
- significant improvement
- k means
- data streams
- search algorithm
- objective function
- feature extraction