A branch-and-cut algorithm for the target visitation problem.
Achim HildenbrandtPublished in: EURO J. Comput. Optim. (2019)
Keyphrases
- experimental evaluation
- theoretical analysis
- high accuracy
- computational complexity
- significant improvement
- input data
- preprocessing
- cost function
- probabilistic model
- particle swarm optimization
- computationally efficient
- memory requirements
- optimization algorithm
- learning algorithm
- detection algorithm
- matching algorithm
- times faster
- computational cost
- dynamic programming
- improved algorithm
- k means
- objective function
- recognition algorithm
- space complexity
- target tracking
- classification algorithm
- mobile robot
- np hard
- similarity measure
- image processing