Heuristics for the 0-1 min-knapsack problem
The 0-1 min-knapsack problem consists in finding a subset of items such that the sum of their sizes is larger than or equal to a given constant and the sum of their costs is minimized. We first study a greedy-type heuristic having a worst-case bound of 2. This heuristic is then refined to obtain a n...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1991
|
| Sorozat: | Acta cybernetica
10 No. 1-2 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12488 |
| LEADER | 01073nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta12488 | ||
| 005 | 20220613080712.0 | ||
| 008 | 161015s1991 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Csirik János | |
| 245 | 1 | 0 | |a Heuristics for the 0-1 min-knapsack problem |h [elektronikus dokumentum] / |c Csirik János |
| 260 | |c 1991 | ||
| 300 | |a 15-20 | ||
| 490 | 0 | |a Acta cybernetica |v 10 No. 1-2 | |
| 520 | 3 | |a The 0-1 min-knapsack problem consists in finding a subset of items such that the sum of their sizes is larger than or equal to a given constant and the sum of their costs is minimized. We first study a greedy-type heuristic having a worst-case bound of 2. This heuristic is then refined to obtain a new one with a worst-case bound of 3/2. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12488/1/cybernetica_010_numb_001_002_015-020.pdf |z Dokumentum-elérés |