July 04, 2016 article Open access The recoverable robust spanning tree problem with interval costs is polynomially solvable Optimization Letters DOI: 10.1007/s11590-016-1057-x Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 3 stored of 20 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 Matroid bases with cardinality constraints on the intersection 2021 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access 9 citations An Investigation of the Recoverable Robust Assignment Problem 2020 RWTH Publications (RWTH Aachen) conference-paper Computer Science Complexity and Algorithms in Graphs Open access 6 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 3 results References 0