haku: @author Boland, N. / yhteensä: 3
viite: 1 / 3
« edellinen | seuraava »
Tekijä:Boland, N.
Otsikko:The asymmetric traveling salesman problem with replenishment arcs
Lehti:European Journal of Operational Research
2000 : JUN 1, VOL. 123:2, p. 408-427
Asiasana:OPERATIONAL RESEARCH
OPTIMIZATION
TRAVELLING SALESMAN PROBLEM
Kieli:eng
Tiivistelmä:The authors consider a constrained asymmetric traveling salesman problem with knapsack-like constraints on subpaths of the tour. This problem arises in routing aircraft. The authors formulate the problem with an exponential number of variables that correspond to feasible subpaths. They study certain polyhedral aspects of the reformulation and present a branch-and-price-and-cut algorithm for solving it.
SCIMA tietueen numero: 213217
lisää koriin
« edellinen | seuraava »
SCIMA