January 01, 2014 article Open access A Study on the Computational Complexity of the Bilevel Knapsack Problem SIAM Journal on Optimization DOI: 10.1137/130906593 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 4 stored of 79 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 Completeness in the Polynomial Hierarchy for Many Natural Problems in Bilevel and Robust Optimization 2025 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs 4 citations The trouble with the second quantifier 2021 4OR article Computer Science Complexity and Algorithms in Graphs Open access 27 citations The subset sum game revisited 2021 Theory of Computing Systems article Engineering Optimization and Packing Problems Open access 1 citations A faster algorithm for the continuous bilevel knapsack problem 2020 Operations Research Letters article Engineering Optimization and Packing Problems 8 citations 4 results References 0