set covering problem

Symmetry Presolving for Mixed-Integer Programs: Binary Structure Preservation and Relations to Orbital Branching

Categories Integer Programming Tags , , , ,

This paper investigates a presolving method for handling symmetries in mixed-integer programs, based on inequalities computed from so-called Schreier-Sims tables. We show that an iterative application of this method together with merging variables produces an instance for which the symmetry group is trivial. We then prove that the problem structure can be preserved for certain … Read more

Improved Handling of Uncertainty and Robustness in Set Covering Problems

Categories Applications - OR and Management Sciences, Cutting Plane Approaches, Robust Optimization Tags , , ,

This paper studies the emergency service facility location problem in an uncertain environment. The main focus is the integration of uncertainty regarding the covered area due to uncertain traveling times. Previous approaches only consider either probabilistic or fuzzy optimization to cope with uncertainty. However, in many real-world problems the required statistical parameters are not precisely … Read more

A Robust Formulation of the Uncertain Set Covering Problem

Categories Applications - OR and Management Sciences, Robust Optimization Tags , ,

This work introduces a robust formulation of the uncertain set covering problem combining the concepts of robust and probabilistic optimization. It is shown that the proposed robust uncertain set covering problem can be stated as a compact mixed-integer linear programming model which can be solved with modern computer software. This model is a natural extension … Read more