| 000 | 01051nam a2200289 a 4500 | ||
|---|---|---|---|
| 008 | 220126s cau g i000 0 eng d | ||
| 040 |
_aUKM _erda |
||
| 090 |
_aRAND 7 _bP-5042 1973 |
||
| 100 | 1 |
_aWalker, Warren E., _eauthor. |
|
| 245 | 1 | 0 |
_aA heuristic adjacent extreme point algorithm for the fixed charge problem / _cWarren E. Walker |
| 264 | 1 |
_aSanta Monica, California : _bRand Corporation, _c.1973 |
|
| 300 |
_a21 pages ; _c28 cm. |
||
| 336 |
_atext _2rdacontent |
||
| 337 |
_aunmediated _2rdamedia |
||
| 338 |
_avolume _2rdacarrier |
||
| 490 | 1 |
_aThe Rand paper series; _vP-5042 |
|
| 504 | _aIncludes bibliographical references: pages 20-21 | ||
| 650 | 0 | _aLinear programming. | |
| 650 | 0 | _aHeuristic programming. | |
| 710 | 2 |
_aResearch and Development Corporation, _eissuing body. |
|
| 830 | 0 |
_aThe Rand paper series; _vP-5042 |
|
| 907 |
_a.b16962382 _b2022-11-17 _c2022-11-17 |
||
| 942 |
_c4 _n0 _kRAND 7 P-5042 1973 |
||
| 990 | _aafina | ||
| 991 | _aKoleksi Dokumen | ||
| 998 |
_at _b2022-11-17 _cm _da _feng _gcau _y0 _z.b16962382 |
||
| 999 |
_c663140 _d663140 |
||