January 01, 2013 conference-paper A Complexity and Approximability Study of the Bilevel Knapsack Problem Lecture notes in computer science DOI: 10.1007/978-3-642-36694-9_9 OpenAlex Authors 0 Author list not loaded yet. Cited by 2 stored of 28 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 The trouble with the second quantifier 2021 4OR article Computer Science Complexity and Algorithms in Graphs Open access 27 citations A faster algorithm for the continuous bilevel knapsack problem 2020 Operations Research Letters article Engineering Optimization and Packing Problems 8 citations 2 results References 0