000 | 01034nam a2200337Ia 4500 | ||
---|---|---|---|
003 | OSt | ||
005 | 20220912144036.0 | ||
006 | a|||||r|||| 00| 0 | ||
007 | ta | ||
008 | 220909b |||||||| |||| 00| 0 eng d | ||
020 | _a3540402861 (hbk) | ||
024 | _a199187 | ||
037 | _b4685, 09/02/2018, Ashutosh Technical Books | ||
037 | _cTextual | ||
040 | _beng | ||
041 | _aeng | ||
082 | _aB28931, P4 | ||
100 | _aKellerer Hans | ||
245 | 0 |
_cKellerer Hans; Pferschy Ulrich; Pisinger David _aKnapsack problems |
|
260 |
_aHeidelberg _bSpringer _c2004 |
||
300 |
_axx,546p. ill. _ccm |
||
500 | _aReferences 495-525p.; Author index 527-533p.; Subject index 535-546p. | ||
650 | _a Basic algorithmic concepts | ||
650 | _a Multiple knapsack problems | ||
650 | _a Subset sum problem | ||
650 | _aComputer Science | ||
700 | _a Pferschy Ulrich | ||
700 | _a Pisinger David | ||
942 |
_hB28931, P4 _cTEXL _2CC |
||
999 |
_c1651 _d1651 |