A branch and bound algorithm for the tra
β
Kashi N. Singh; Dirk L. van Oudheusden
π
Article
π
1997
π
Elsevier Science
π
English
β 616 KB
An important generalization of the traveling salesman problem called the traveling purchaser problem is considered. A branch and bound algorithm which solves a related simple plant location problem for calculating the bounds is proposed for this problem. Computational experiments with this algorithm