November 01, 1981 article A fully polynomial approximation algorithm for the 0–1 knapsack problem European Journal of Operational Research DOI: 10.1016/0377-2217(81)90175-2 OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 71 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Online Unbounded Knapsack 2025 Theory of Computing Systems article Computer Science Optimization and Search Problems Open access 2 citations 1 result References 0