A branch-and-cut algorithm for the capacitated profitable tour problem.
Mads Kehlet JepsenBjørn PetersenSimon SpoorendonkDavid PisingerPublished in: Discret. Optim. (2014)
Keyphrases
- learning algorithm
- np hard
- detection algorithm
- optimization algorithm
- computational complexity
- single source
- search space
- objective function
- theoretical analysis
- worst case
- dynamic programming
- expectation maximization
- simulated annealing
- tree structure
- classification algorithm
- matching algorithm
- times faster
- knapsack problem
- recognition algorithm
- high accuracy
- probabilistic model
- computational cost
- experimental evaluation
- cost function
- preprocessing
- optimal solution
- particle swarm optimization
- linear programming
- segmentation algorithm
- clustering method
- multistage
- significant improvement
- k means
- traveling salesman problem
- bayesian networks