| 000 | 01050nam a2200313 a 4500 | ||
|---|---|---|---|
| 008 | 140612s1971 cau i000 0 eng d | ||
| 020 | _cHadiah | ||
| 039 | 9 |
_y06-12-2014 _zazam |
|
| 040 |
_aUKM _erda |
||
| 090 |
_aRAND 7 _bP-4592 1971 |
||
| 100 | 1 |
_aFox, Bennett L., _d1938- |
|
| 245 | 1 | 0 |
_aInteger programming and K-th shortest paths / _cB. L. Fox. |
| 264 | 1 |
_aSanta Monica, California : _bRand Corporation, _c1971 |
|
| 300 |
_a5 pages ; _c28 cm. |
||
| 336 |
_atext _2rdacontent |
||
| 337 |
_aunmediated _2rdamedia |
||
| 338 |
_avolume _2rdacarrier |
||
| 490 | 1 |
_aThe Rand paper series ; _vP-4592 |
|
| 504 | _aIncludes bibliographical references (page 5) | ||
| 650 | 0 | _aInteger programming. | |
| 710 | 2 |
_aResearch and Development Corporation, _eissuing body. |
|
| 830 | 0 |
_aRand paper series ; _vP-4592 |
|
| 907 |
_a.b15926333 _b2022-08-09 _c2019-11-12 |
||
| 942 |
_c4 _n0 _kRAND 7 P-4592 1971 |
||
| 914 | _avtls003562224 | ||
| 990 | _azear | ||
| 991 | _aKoleksi Dokumen | ||
| 998 |
_at _b2014-12-06 _cm _da _feng _gcau _y0 _z.b15926333 |
||
| 999 |
_c572092 _d572092 |
||