April 18, 2019 article Open access Robust recoverable 0–1 optimization problems under polyhedral uncertainty European Journal of Operational Research DOI: 10.1016/j.ejor.2019.04.017 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 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 Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes 2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access 0 citations 1 result References 0