November 07, 2017 article Open access Complexity of min–max–min robustness for combinatorial optimization under discrete uncertainty Discrete Optimization DOI: 10.1016/j.disopt.2017.08.006 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 2 stored of 14 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 Min–max–min robustness for combinatorial problems with discrete budgeted uncertainty 2020 Discrete Applied Mathematics article Decision Sciences Risk and Portfolio Optimization Open access 13 citations Oracle-based algorithms for binary two-stage robust optimization 2020 Computational Optimization and Applications article Decision Sciences Risk and Portfolio Optimization Open access 19 citations 2 results References 0