-
1
-
-
84947282912
-
The asymmetric traveling salesman problem: Algorithms, instance generators and tests
-
Washington DC, to appear
-
J. Cirasella, D.S. Johnson, L.A. McGeoch, W. Zhang, The asymmetric traveling salesman problem: algorithms, instance generators and tests, Proceedings of third Workshop on Algorithm Engineering and Experiments (ALENEX 01), Washington DC, 2001, to appear.
-
(2001)
Proceedings of Third Workshop on Algorithm Engineering and Experiments (ALENEX 01)
-
-
Cirasella, J.1
Johnson, D.S.2
McGeoch, L.A.3
Zhang, W.4
-
2
-
-
0035283868
-
Construction heuristics for the asymmetric TSP
-
DOI 10.1016/S0377-2217(99)00468-3
-
F. Glover, G. Gutin, A. Yeo, and A. Zverovich Construction heuristics for the asymmetric traveling salesman problem European J. Oper. Res. 129 2001 555 568 (Pubitemid 32086843)
-
(2001)
European Journal of Operational Research
, vol.129
, Issue.3
, pp. 555-568
-
-
Glover, F.1
Gutin, G.2
Yeo, A.3
Zverovich, A.4
-
3
-
-
0031140372
-
The travelling salesman problem: New solvable cases and linkages with the development of approximation algorithms
-
F. Glover, and A. Punnen The traveling salesman problem: new solvable cases and linkages with the development of approximation algorithms J. Oper. Res. Soc. 48 1997 502 510 (Pubitemid 127599406)
-
(1997)
Journal of the Operational Research Society
, vol.48
, Issue.5
, pp. 502-510
-
-
Glover, F.1
Punnen, A.P.2
-
4
-
-
84867953589
-
Polynomial approximation algorithms for the TSP and the QAP with factorial domination number
-
to appear
-
G. Gutin, A. Yeo, Polynomial approximation algorithms for the TSP and the QAP with factorial domination number, Discrete Appl. Math., to appear.
-
Discrete Appl. Math.
-
-
Gutin, G.1
Yeo, A.2
-
5
-
-
0035305859
-
TSP tour domination and Hamilton cycle decomposition of regular digraphs
-
to appear
-
G. Gutin, A. Yeo, TSP tour domination and Hamilton cycle decomposition of regular digraphs, Oper. Res. Lett., to appear.
-
Oper. Res. Lett.
-
-
Gutin, G.1
Yeo, A.2
-
7
-
-
0001193147
-
The traveling salesman problem: A case study in local optimization
-
E.H.L. Aarts, J.K. Lenstra (Eds.) Wiley, New York
-
D.S. Johnson, L.A. McGeoch, The traveling salesman problem: a case study in local optimization. in: E.H.L. Aarts, J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization, Wiley, New York, 1997, 215-310.
-
(1997)
Local Search in Combinatorial Optimization
, pp. 215-310
-
-
Johnson, D.S.1
McGeoch, L.A.2
|