November 25, 2011 article Recoverable robust shortest path problems Networks DOI: 10.1002/net.20487 OpenAlex Authors 0 Author list not loaded yet. Cited by 4 stored of 54 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 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 Fault-Tolerant Edge-Disjoint Paths -- Beyond Uniform Faults 2020 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access 0 citations 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 4 results References 0