A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
From MaRDI portal
Publication:2157911
DOI10.1016/j.orl.2022.05.001OpenAlexW4228999872MaRDI QIDQ2157911
Naonori Kakimura, Yusuke Kobayashi, Naoyuki Kamiyama, Takehiro Ito, Yoshio Okamoto
Publication date: 22 July 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2022.05.001
Cites Work
- Unnamed Item
- Unnamed Item
- Recoverable robust knapsacks: the discrete scenario case
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robust discrete optimization and its applications
- Approximating the min-max (regret) selecting items problem
- A randomized algorithm for the min-Max selecting items problem with uncertain weights
- Robust recoverable and two-stage selection problems
- Bulk-robust combinatorial optimization
- Recoverable robust shortest path problems
- The Recoverable Robust Two-Level Network Design Problem
- Integer Programming with a Fixed Number of Variables
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Rado's theorem for polymatroids
- Robust recoverable perfect matchings
- Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
- Recoverable Robust Combinatorial Optimization Problems
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- Parameterized Algorithms
- Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms
- On the complexity of a class of combinatorial optimization problems with uncertainty
This page was built for publication: A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
