Robust multicovers: algorithms and complexity

MaRDI QIDQ5066958zbMATH OpenFDO

Authors Eva Schmidt

Publication date 31 March 2022

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Robust multicovers with budgeted uncertainty
• Thresholded Covering Algorithms for Robust and Max-min Optimization
• Thresholded covering algorithms for robust and max-min optimization
• Robust min-max regret covering problems
• Improved handling of uncertainty and robustness in set covering problems

Cited in

(4)

• Robust algorithms: a different approach to oracles
• Robust multicovers with budgeted uncertainty
• On generalizations of partial scenario set cover
• On constrained minimum weight edge covers with applications to emergency planning

This page was built for publication: Robust multicovers: algorithms and complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5066958)