000			00599nam a2200181Ia 4500
008			131223s9999 xx 000 0 und d
040			_aISI KOLKATA
041			_aEnglish
082			_a658.57 _bC289(369)
100			_aSmith T H C
245			_aComputational performance of three subtour elimination algorithms for solving asymmetric traveling salesman problems
260			_aPittsburgh _bCIT _c1975
440			_aCarnegie Institute of Technology : Management Science Research Report; No. 369
650			_aComputational
650			_aTraveling
700			_aSrinivasan V _4Auth.
942			_cBK
999			_c81214 _d81214