A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem.
Duc-Cuong DangRacha El-HajjAziz MoukrimPublished in: CPAIOR (2013)
Keyphrases
- significant improvement
- theoretical analysis
- detection algorithm
- matching algorithm
- probabilistic model
- np hard
- times faster
- combinatorial optimization
- cost function
- preprocessing
- experimental evaluation
- computational cost
- computational complexity
- optimal solution
- improved algorithm
- particle swarm optimization
- convex hull
- high accuracy
- knapsack problem
- segmentation algorithm
- quadratic optimization problems
- expectation maximization
- worst case
- search space
- learning algorithm
- neural network
- linear programming
- data sets
- dynamic programming
- convergence rate
- similarity measure
- randomly generated
- algebraic equations