haku: @indexterm Travelling salesman problem / yhteensä: 62
viitteet: 3-12 / 62
« edellinen sivu | seuraava sivu »
 otsikkovuositekijä
3.
A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex
European Journal of Operational Research
2000 : JUL 16, VOL. 124:2, p. 267-282
 2000 Tang, L.
4.
The asymmetric traveling salesman problem with replenishment arcs
European Journal of Operational Research
2000 : JUN 1, VOL. 123:2, p. 408-427
 2000 Boland, N.
5.
A computational study of smoothening heuristics for the traveling salesman problem
European Journal of Operational Research
2000 : JUL, VOL. 124:1, p. 15-27
 2000 Coy, S.P.
Golden, B.L.
Wasil, E.A.
6.
Cluster based branching for the asymmetric travelling salesman problem
European Journal of Operational Research
1999 : DEC 1, VOL. 119:2, p. 314-325
 1999 Lysgaard, J.
7.
Submodularity and the traveling salesman problem
European Journal of Operational Research
1999 : MAY 1, VOL. 114:3, p. 489-508
 1999 Herer, Y.
8.
A self-organising model for the travelling salesman problem
Journal of the Operational Research Society
1997 : SEP, Vol. 48:9, p. 919-928
 1997 Somhom, S.
Modares, A.
Enkawa, T.
9.
A self-organising model for the travelling salesman problem
Journal of the Operational Research Society
1997 : SEP, VOL. 48:9, p. 919-228
 1997 Somhom, S.
Modares, A.
Enkawa, T.
10.
A time-based formulation and upper bounding scheme for the selective travelling salesperson problem
Journal of the Operational Research Society
1997 : MAY, VOL. 48:5, p. 511-518
 1997 Millar, H.H.
Kiragu, M.
11.
The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
Journal of the Operational Research Society
1997 : MAY, VOL. 48:5, p. 502-510
 1997 Glover, F.
Punnen, A.P.
12.
Ants can colour graphs
Journal of the Operational Research Society
1997 : MAR, VOL. 48:3, p. 295-305
 1997 Costa, D.
Hertz, A.
« edellinen sivu | seuraava sivu »
SCIMA