March 26, 2011 article Recoverable robust knapsacks: the discrete scenario case Optimization Letters DOI: 10.1007/s11590-011-0307-1 OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 52 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 Complexity Classes of Hamming Distance Recoverable Robust Problems 2024 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs 1 citations 1 result References 0