{"paper":{"title":"On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"math.OC","authors_text":"Adam Kasperski, Andr\\'e Chassein, Marc Goerigk, Pawe{\\l} Zieli\\'nski","submitted_at":"2017-01-21T18:11:46Z","abstract_excerpt":"In this paper the problem of selecting $p$ out of $n$ available items is discussed, such that their total cost is minimized. We assume that costs are not known exactly, but stem from a set of possible outcomes.\n  Robust recoverable and two-stage models of this selection problem are analyzed. In the two-stage problem, up to $p$ items is chosen in the first stage, and the solution is completed once the scenario becomes revealed in the second stage. In the recoverable problem, a set of $p$ items is selected in the first stage, and can be modified by exchanging up to $k$ items in the second stage,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06064","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}