A branch-and-cut algorithm for the Team Orienteering Problem.
Nicola BianchessiRenata MansiniM. Grazia SperanzaPublished in: Int. Trans. Oper. Res. (2018)
Keyphrases
- cost function
- learning algorithm
- detection algorithm
- k means
- optimal solution
- recognition algorithm
- np hard
- experimental evaluation
- times faster
- objective function
- improved algorithm
- computational cost
- selection algorithm
- memory requirements
- matching algorithm
- tree structure
- probabilistic model
- dynamic programming
- computational complexity
- similarity measure
- expectation maximization
- particle swarm optimization
- high accuracy
- worst case
- neural network
- hidden markov models
- hardware implementation