Improved handling of uncertainty and robustness in set covering problems

DOI10.1016/J.EJOR.2017.04.044MaRDI QIDQ1695010zbMATH OpenOpenAlexFDO

Authors Pascal Lutter, Dirk Degel, Christina Büsing, Arie M. C. A. Koster, Brigitte Werners

Publication date 6 February 2018

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2017.04.044

zbMATH Keywords

integer programmingrobust optimizationset covering problememergency medical servicescutting plane algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10) Discrete location and assignment (90B80)

Recommendations

• The robust set covering problem with interval data
• Robust min-max regret covering problems
• Probabilistic set covering with correlations
• Formulation and algorithms for the robust maximal covering location problem
• Covering location problem of emergency service facilities in an uncertain environment

Cites work

• scientific article; zbMATH DE number 2121076 (Why is no real title available?)
• A Lagrangian-based heuristic for large-scale set covering problems
• Ambiguous chance constrained problems and robust optimization
• Ambulance location and relocation models.
• An algorithm for set covering problem
• An alternative formulation for certain fuzzy set-covering problems
• Benchmarking optimization software with performance profiles.
• Chance-constrained programming
• Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
• Covering models and optimization techniques for emergency response facility location and planning: a review
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Distributionally Robust Convex Optimization
• Exact solution of the robust knapsack problem
• MIP reformulations of the probabilistic set covering problem
• Probabilistic set covering with correlations
• Recoverable robust knapsacks: \(\Gamma \)-scenarios
• Reducibility among combinatorial problems
• Review, extension and prediction in emergency service siting models
• Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
• Solving a fuzzy set-covering problem
• Strategic facility location: A review
• The Location of Emergency Service Facilities
• The Price of Robustness
• The Probabilistic Set-Covering Problem
• The robust set covering problem with interval data
• The set covering problem revisited: an empirical study of the value of dual information

Cited in

(10)

• A general model and efficient algorithms for reliable facility location problem under uncertain disruptions
• Robust multicovers: algorithms and complexity
• Robust strategic planning for mobile medical units with steerable and unsteerable demands
• Set coverage and robust policy
• Robust multicovers with budgeted uncertainty
• Formulation and algorithms for the robust maximal covering location problem
• Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles
• Robust min-max regret covering problems
• The robust set covering problem with interval data
• Probabilistic set covering with correlations

Describes a project that uses

Uses Software

• XPRESS

This page was built for publication: Improved handling of uncertainty and robustness in set covering problems

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