The symmetric travelling salesman problem I. New fast lower bounds for the problem of optimal 2-matching-Reference-Cited by-同舟云学术

The symmetric travelling salesman problem I. New fast lower bounds for the problem of optimal 2-matching

Published:2009-11 Issue:11 Volume:70 Page:1901-1912
ISSN:0005-1179
Container-title:Automation and Remote Control
language:en
Short-container-title:Autom Remote Control

Author:

Sergeev S. I.

Publisher

Pleiades Publishing Ltd

Subject

Control and Systems Engineering,Electrical and Electronic Engineering

Link

http://link.springer.com/content/pdf/10.1134/S0005117909110149.pdf

Reference30 articles.

1. The Travelling Salesman Problem. A Guided Tour of Combinatorial Optimization, Lawler, E.L., Lenstra, J.K., Rinnoy Kan, A.H.G., and Shmoys, D.B., Eds., New York: Wiley, 1985.

2. Melamed, I.I., Sergeev, S.I., and Sigal, I.Kh., The Traveling Salesman Problem. I-III, Autom. Remote Control, 1989, no. 9, pp. 1147–1173; no. 10, pp. 1303–1324; no. 11, pp. 1459–1479.

3. The Travelling Salesman Problem and Its Variations, Gutin, G. and Punnen, A.P., Eds., Dordrecht: Kluwer, 2002.

4. Held, M. and Karp, R., The Travelling Salesman Problem and Minimum Spanning Trees, Operat. Res., 1970, vol. 18, no. 6, pp. 1139–1162.

5. Balas, E. and Christofides, N., A Restricted Lagrangean Approach to the Travelling Salesman Problem, Math. Program., 1981, no. 1, pp. 19–46.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Maximum travelling salesman problem. I;Automation and Remote Control;2014-12

2. Nonlinear resolving functions for the travelling salesman problem;Automation and Remote Control;2013-06

3. The symmetric travelling salesman problem II. New low bounds;Automation and Remote Control;2010-04