Improved handling of uncertainty and robustness in set covering problems

DOI10.1016/j.ejor.2017.04.044zbMath1380.90161OpenAlexW2608348709MaRDI QIDQ1695010

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

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 programmingset covering problemrobust optimizationemergency medical servicescutting plane algorithms

Mathematics Subject Classification ID

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

Related Items

Robust min-max regret covering problems, A General Model and Efficient Algorithms for Reliable Facility Location Problem Under Uncertain Disruptions, Robust strategic planning for mobile medical units with steerable and unsteerable demands, Robust multicovers with budgeted uncertainty

Uses Software

• XPRESS

Cites Work

• Unnamed Item
• Exact solution of the robust knapsack problem
• The robust set covering problem with interval data
• Solving a fuzzy set-covering problem
• An alternative formulation for certain fuzzy set-covering problems
• MIP reformulations of the probabilistic set covering problem
• Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
• Review, extension and prediction in emergency service siting models
• A Lagrangian-based heuristic for large-scale set covering problems
• Strategic facility location: A review
• An algorithm for set covering problem
• Ambulance location and relocation models.
• Covering models and optimization techniques for emergency response facility location and planning: a review
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Ambiguous chance constrained problems and robust optimization
• The set covering problem revisited: an empirical study of the value of dual information
• Chance-Constrained Programming
• Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem
• Distributionally Robust Convex Optimization
• Recoverable Robust Knapsacks: Γ-Scenarios
• The Probabilistic Set-Covering Problem
• The Price of Robustness
• Reducibility among Combinatorial Problems
• Probabilistic Set Covering with Correlations
• The Location of Emergency Service Facilities
• Benchmarking optimization software with performance profiles.