A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints.
Sylvie BorneAli Ridha MahjoubRaouia TaktakPublished in: Electron. Notes Discret. Math. (2013)
Keyphrases
- optimal solution
- experimental evaluation
- preprocessing
- search space
- k means
- np hard
- ant colony optimization
- optimization algorithm
- learning algorithm
- matching algorithm
- constrained optimization
- geometric constraints
- computational cost
- cost function
- linear constraints
- multiple constraints
- theoretical analysis
- traveling salesman problem
- detection algorithm
- high accuracy
- worst case
- objective function
- times faster
- convex hull
- improved algorithm
- dynamic programming
- significant improvement
- global constraints
- path consistency
- image segmentation