January 01, 2025 conference-paper Open access Recoverable Robust Cardinality Constrained Maximization with Commitment of a Submodular Function Lecture notes in computer science DOI: 10.1007/978-3-031-98740-3_27 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 0 stored of 1 References 2 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 linear time algorithm for the robust recoverable selection problem 2020 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs Open access 9 citations Recoverable robust optimization with commitment 2026 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access 3 citations 2 results