haku: @indexterm Travelling salesman problem / yhteensä: 62
viitteet: 31-40 / 62
« edellinen sivu | seuraava sivu »
 otsikkovuositekijä
31.
A prior optimization.
Operations Research
1990 : NOV-DEC, VOL. 38:6, p. 1019-1033
 1990 Bertsimas, D. J.
Jaillet, P.
Odoni, A. R.
32.
A note on dual solutions of the assignment problem in connection with the traveling salesman problem.
European Journal of Operational Research
1990 : FEB 15, VOL. 44:3, p. 410-413
 1990 Jeromin, B.
Körner, F.
33.
An exact solution method for the MTSP
Journal of the Operational Research Society
1989 : MAY, VOL. 40:5, p. 461-469
 1989 Husban, A.
34.
A branch-and-cut approach to a traveling salesman problem with side constraints.
Management Science
1989 : NOV, VOL. 35:11, p. 1393-1412
 1989 Padberg, M.
Rinaldi, G.
35.
An additive bounding procedure for combinatorial optimization problems.
Operations Research
1989 : MAR-APR, VOL. 37:2, p. 319-328
 1989 Fischetti, M.
Toth, P.
36.
An effective method of balancing the work load amongst salesmen
Omega
1988 : VOL. 16:2, p.159-163
 1988 Okonjo-Adigwe, C.
37.
A priori solution of a traveling salesman problem in which a random subset of the customers are visited.
Operations Research
1988 : NOV-DEC, VOL. 36:6, p. 929-936
 1988 Jaillet, P.
38.
Langranian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows.
Management Science
1988 : AUG, VOL. 34:8, p. 1005-1022
 1988 Desrosiers, J.
Sauve, M.
Soumis, F.
39.
A heuristic algorithm for the traveling salesman location problem on networks.
Operations Research
1988 : MAY-JUN, VOL. 36:3, p. 478-484
 1988 Simchi-Levi, D.
Berman, O.
40.
Minisum location of a travelling salesman on simple networks.
European Journal of Operational Research
1988 : AUG, VOL. 36:2, p. 241-250
 1988 Berman, O.
Simchi-Levi, D.
« edellinen sivu | seuraava sivu »
SCIMA