{
  "abstract": "We study the k-delete recoverable robust 0-1 problem in which a decision-maker solves a combinatorial optimization problem subject to objective uncertainty. The model follows a two-stage robust setup. The decision-maker first commits to an initial plan and may then revoke up to k components of this decision after the uncertainty is revealed. The underlying uncertainty is modeled using a budgeted uncertainty set so that the decision-maker only hedges against a limited number of deviations in the uncertain parameters. We present four reformulations of the k-delete recoverable robust problem, which can be tackled using (i) general-purpose mixed-integer linear programming solvers, (ii) branch-and-cut methods, or (iii) column-and-constraint generation algorithms. For each formulation, we identify suitable solution methods and prove their correctness. Overall, we present eight approaches to solve the k-delete recoverable robust problem, which we assess and compare in an extensive computational study on instances of the assignment problem and the single-source capacitated facility location problem.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.29478",
  "author_total": 3,
  "authors": [
    {
      "name": "Yasmine Beck"
    },
    {
      "name": "Christina Büsing"
    },
    {
      "name": "Ivana Ljubić"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/4dzfxf95h2ez9.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.29478",
  "fulltext_url": null,
  "id": "4dzfxf95h2ez9",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.29478",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.OC"
    ],
    [
      "openalex",
      "1803|Risk and Portfolio Optimization"
    ]
  ],
  "openalex": "W7160679886",
  "pdf_url": "https://arxiv.org/pdf/2609.29478",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-01",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/4dzfxf95h2ez9.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:24:15Z",
      "native_id": "2609.29478",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.29478"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.OC",
      "subfield": "optimisation-control"
    }
  ],
  "title": "Exact Methods for Solving k-Delete Recoverable Robust 0-1 Problems Under Budgeted Uncertainty",
  "title_text": "Exact Methods for Solving k-Delete Recoverable Robust 0-1 Problems Under Budgeted Uncertainty",
  "type": "preprint",
  "updated_at": "2026-10-30T12:24:15Z",
  "url": "https://research.draconitic.com/paper/4dzfxf95h2ez9",
  "venue": "arXiv",
  "versions": []
}