| 000 | 00545nam a2200157Ia 4500 | ||
|---|---|---|---|
| 008 | 131223s9999 xx 000 0 und d | ||
| 040 | _aISI KOLKATA | ||
| 041 | _aEnglish | ||
| 082 |
_a658.57 _bC289(380) |
||
| 100 | _aSmith T H C | ||
| 245 | _aLifo implicit enumeration algorithm for the asymmetric traveling salesman problem using a one arborescence relaxation | ||
| 260 |
_aPittsburgh _bCIT _c1975 |
||
| 440 | _aCarnegie Institute of Technology : Management Science Research Report; No. 380 | ||
| 650 | _aAsymmetric traveling | ||
| 942 | _cBK | ||
| 999 |
_c81252 _d81252 |
||