𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exploring greedy criteria for the dynamic traveling purchaser problem

✍ Scribed by E. Angelelli; R. Mansini; M. Vindigni


Book ID
106274021
Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
404 KB
Volume
17
Category
Article
ISSN
1435-246X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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