A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem.
Gilbert LaporteJorge Riera-LedesmaJuan José Salazar GonzálezPublished in: Oper. Res. (2003)
Keyphrases
- learning algorithm
- high accuracy
- improved algorithm
- computational cost
- data sets
- recognition algorithm
- k means
- times faster
- dynamic programming
- computational complexity
- convergence rate
- detection algorithm
- cost function
- search space
- worst case
- neural network
- linear programming
- segmentation algorithm
- matching algorithm
- significant improvement
- objective function
- similarity measure
- theoretical analysis
- experimental evaluation
- tree structure
- classification algorithm
- benchmark problems
- selection algorithm