𝔖 Bobbio Scriptorium
✦   LIBER   ✦

MIP reformulations of the probabilistic set covering problem

✍ Scribed by Anureet Saxena; Vineet Goyal; Miguel A. Lejeune

Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
402 KB
Volume
121
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Probabilistic partial set covering probl
Probabilistic partial set covering problems
✍ Hanif D. Sherali; Seong-In Kim; Edna L. Parrish πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 563 KB
A probabilistic heuristic for a computat
A probabilistic heuristic for a computationally difficult set covering problem
✍ Thomas A Feo; Mauricio G.C Resende πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 319 KB

An efficient probabilistic set covering heuristic is presented. The heuristic is evaluated on empirically difficult to solve set covering problems that arise from Steiner triple systems. The optimal solution to only a few of these instances is known. The heuristic provides these solutions as well as