Recoverable Robust Combinatorial Optimization Problems
From MaRDI portal
Publication:5171791
DOI10.1007/978-3-319-00795-3_22zbMath1305.90353OpenAlexW64710111MaRDI QIDQ5171791
Adam Kasperski, Adam Kurpisz, Paweł Zieliński
Publication date: 12 February 2015
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-00795-3_22
Related Items (7)
The recoverable robust spanning tree problem with interval costs is polynomially solvable ⋮ A parameterized view to the robust recoverable base problem of matroids under structural uncertainty ⋮ On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty ⋮ Recoverable robust spanning tree problem under interval uncertainty representations ⋮ Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
This page was built for publication: Recoverable Robust Combinatorial Optimization Problems
