Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem
Published Online:1 Jun 1980https://doi.org/10.1287/opre.28.3.623
- Cited by
- Travel Behaviour and Society, Vol. 38
- 17 December 2021 | Sensors, Vol. 21, No. 24
- Discrete Applied Mathematics, Vol. 296
- 18 October 2019 | The VLDB Journal, Vol. 29, No. 1
- IEEE Transactions on Visualization and Computer Graphics, Vol. 24, No. 11
- Pervasive and Mobile Computing, Vol. 42
- 18 November 2009 | Automation and Remote Control, Vol. 70, No. 11
- American Journal of Mathematical and Management Sciences, Vol. 13, No. 3-4
- 22 August 2014
- Computers & Industrial Engineering, Vol. 10, No. 2
- Operations Research Letters, Vol. 4, No. 2
- European Journal of Operational Research, Vol. 19, No. 1
- 27 June 2007 | Optimization, Vol. 16, No. 5
- European Journal of Operational Research, Vol. 12, No. 4
- 11 October 2006 | Networks, Vol. 11, No. 2
Volume 28, Issue 3-part-i
May-June 1980
Pages 445-632
Article Information
Metrics
Information
- Published Online:June 01, 1980
© 1980 INFORMS
Cite as
R. Jonker, G. De Leve, J. A. Van Der Velde, A. Volgenant, (1980) Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem. Operations Research 28(3-part-i):623-627.
https://doi.org/10.1287/opre.28.3.623
