September 01, 2018 article Open access Robust combinatorial optimization under convex and discrete cost uncertainty EURO Journal on Computational Optimization DOI: 10.1007/s13675-018-0103-0 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 5 stored of 61 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 Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints 2024 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs 5 citations 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 An Integer Programming Approach to Deep Neural Networks with Binary Activation Functions 2020 arXiv (Cornell University) preprint Computer Science Neural Networks and Applications Open access 8 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 Discrete optimization methods for group model selection in compressed sensing 2020 Mathematical Programming article Engineering Sparse and Compressive Sensing Techniques Open access 6 citations 5 results References 0