haku: @author Bean, J. C. / yhteensä: 7
viite: 1 / 7
« edellinen | seuraava »
| Tekijä: | Noon, C. E. Bean, J. C. |
| Otsikko: | A lagrangian based approach for the asymmetric generalized traveling salesman problem. |
| Lehti: | Operations Research
1991 : JUL-AUG, VOL. 39:4, p. 623-632 |
| Asiasana: | TRAVELLING SALESMAN PROBLEM |
| Kieli: | eng |
| Tiivistelmä: | The generalized traveling salesman problem /GTSP/ is a difficult optimization problem with potential applications in the areas of distribution, warehousing and scheduling. Its enhancement over the traditional traveling salesman problem /TSP/ is its ability to simultaneously combine selection and sequencing decisions. The combined approach of bounding, elimination and enumeration proves to be a practical method for solving the asymmetric GTSP. The approach blends the task of searching for optimal solution and establishing its optimality in an efficient and organized fashion. |
« edellinen | seuraava »
SCIMA