Vineet Goyal, Carnegie Mellon University
Miguel Lejeune, Carnegie Mellon University
(SPEPS)
To export the complete metadata set as Endote or Bibtex format please click to the appropriate link.
| edoc-Server der Humboldt-Universität zu Berlin |
| Author(s): |
Anureet Saxena, Carnegie Mellon University Vineet Goyal, Carnegie Mellon University Miguel Lejeune, Carnegie Mellon University | Title: | MIP Reformulations of the Probabilistic Set Covering Problem |
| Date of Acceptance: | 29.05.2007 |
| Submission Date: | 08.02.2007 |
| Series Title: |
Stochastic Programming E-Print Series (SPEPS) |
| Editors: | Julie L. Higle; Werner Römisch; Surrajeet Sen |
| Keywords (eng): | Probabilistic Programming, Set Covering, Mixed Integer Programming, Cutting Planes |
| in: | Mathematical Programnming |
| Metadata export:
To export the complete metadata set as Endote or Bibtex format please click to the appropriate link.
|
Endnote Bibtex |
| Abstract (eng): | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| In this paper we address the following probabilistic version (PSC) of the set cover- ing problem: $ min{cx | P(Ax ≥ ξ) ≥ p, x_j \in {0, 1}N }$ where A is a 0-1 matrix, ξ is a random 0-1 vector and $p \in (0, 1]$ is the threshold probability level. We formulate (PSC) as a mixed integer non-linear program (MINLP) and linearize the resulting (MINLP) to obtain a MIP reformulation. We introduce the concepts of p-inefficiency and polarity cuts. While the former is aimed at reducing the number of constraints in our model, the later is used as a strengthening device to obtain stronger formulations. A hierarchy of relaxations for (PSC) is introduced, and fundamental relationships between the relaxations are established culminating with a MIP reformulation of (PSC) with no additional integer constrained variables. Simplifications of the MIP model which result when one of the following conditions hold are briefly discussed: A is a balanced matrix, A has the circular ones property, the components of ξ are pairwise independent, the distribution function of ξ is a stationary distribution or has the so-called disjunctive shattering property. We corroborate our theoretical findings by an extensive computational experiment on a test-bed consisting of almost 10,000 probabilistic instances. This test-bed was created using deterministic instances from the literature and consists of probabilistic variants of the set-covering model and capacitated versions of facility location, warehouse location and k-median models. Our computational results show that our procedure is orders of magnitude faster than any of the existing approaches to solve (PSC), and in many cases can reduce hours of computing time to fraction of seconds. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Access Statistics:
These data concerning access statistics for individual documents
have been compiled using the webserver log files aggregated by AWSTATS.
They refer to a monthly access count to the full text documents as well as to the entry page.
As for format versions of a document which consist of multiple files (such as HTML) the highest monthly access number to one of the files (chapters) is shown respectivly. To see the detailled access numbers please move the mouse pointer over the single bars of the digaram. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Gesamtzahl der Zugriffe seit May 2011:
|
|
| |||
