MathSciNet Relay Station
MathSciNet bibliographic data
MR1852365 90C27 (90C57)
Rubinstein, J. H.; Thomas, D. A.; Wormald, N. C. A polynomial algorithm for a constrained traveling salesman problem. Networks 38 (2001), no. 2, 68–75.
For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page

American Mathematical Society American Mathematical Society
201 Charles Street
Providence, RI 02904-6248 USA
© Copyright 2017, American Mathematical Society
Privacy Statement