Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A Simple 0.5-Bounded Greedy Algorithm for the 0/1 Knapsack Problem."

U. K. Sarkar et al. (1992)

> Home

Details and statistics

DOI: 10.1016/0020-0190(92)90143-J

access: closed

type: Journal Article

metadata version: 2022-11-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/SarkarCGS92a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/SarkarCGS92a
U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
A Simple 0.5-Bounded Greedy Algorithm for the 0/1 Knapsack Problem. Inf. Process. Lett. 42(3): 173-177 (1992)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.