December 05, 2012 article Open access One-level reformulation of the bilevel Knapsack problem using dynamic programming Discrete Optimization DOI: 10.1016/j.disopt.2012.09.001 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 43 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 A faster algorithm for the continuous bilevel knapsack problem 2020 Operations Research Letters article Engineering Optimization and Packing Problems 8 citations 1 result References 0