Improved handling of uncertainty and robustness in set covering problems
type: Item
instance of: scholarly article
title: Improved handling of uncertainty and robustness in set covering problems
zbMATH Open document ID: 1380.90161
author: Pascal Lutter
author: Dirk Degel
author: Christina Büsing
author: Arie M. C. A. Koster
author: Brigitte Werners
published in: European Journal of Operational Research
publication date: 2018-02-06T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6835203
zbMATH Keywords: integer programming
zbMATH Keywords: set covering problem
zbMATH Keywords: robust optimization
zbMATH Keywords: cutting plane algorithms
zbMATH Keywords: emergency medical services
describes a project that uses: XPRESS
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.04.044
OpenAlex ID: W2608348709
cites work: Probabilistic Set Covering with Correlations
cites work: An algorithm for set covering problem
cites work: The Probabilistic Set-Covering Problem
cites work: The Price of Robustness
cites work: Ambulance location and relocation models.
cites work: Recoverable Robust Knapsacks: Γ-Scenarios
cites work: A Lagrangian-based heuristic for large-scale set covering problems
cites work: Chance-constrained programming
cites work: An alternative formulation for certain fuzzy set-covering problems
cites work: Benchmarking optimization software with performance profiles.
cites work: Ambiguous chance constrained problems and robust optimization
cites work: Cutting plane versus compact formulations for uncertain (integer) linear programs
cites work: Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
cites work: Solving a fuzzy set-covering problem
cites work: Reducibility among Combinatorial Problems
cites work: Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
cites work: Covering models and optimization techniques for emergency response facility location and planning: a review
cites work: Exact solution of the robust knapsack problem
cites work: Strategic facility location: A review
cites work: The robust set covering problem with interval data
cites work: Q4830009
cites work: Review, extension and prediction in emergency service siting models
cites work: MIP reformulations of the probabilistic set covering problem
cites work: The Location of Emergency Service Facilities
cites work: Distributionally Robust Convex Optimization
cites work: The set covering problem revisited: an empirical study of the value of dual information
DOI: 10.1016/J.EJOR.2017.04.044
description: scientific article; zbMATH DE number 6835203