Probabilistic partial set covering problems

DOI10.1002/1520-6750(199102)38:1%3C41::AID-NAV3220380106%3E3.0.CO;2-LzbMATH Open0725.90034OpenAlexW2036208295MaRDI QIDQ5202816FDOQ5202816

Authors: Hanif D. Sherali, Seong-In Kim, Edna L. Parrish 

Publication date: 1991

Full work available at URL: https://doi.org/10.1002/1520-6750(199102)38:1%3C41::aid-nav3220380106%3E3.0.co;2-l

Recommendations

• A new reformulation approach for the generalized partial covering problem
• The Probabilistic Set-Covering Problem
• scientific article; zbMATH DE number 4023016
• Improved handling of uncertainty and robustness in set covering problems
• Probabilistic set covering with correlations

zbMATH Keywords

branch-and-boundgroup of facilitiesprobabilistic partial set coveringtotal service reliability

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• A tree-search algorithm for mixed integer programming problems
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study

Cited In (6)

• The Probabilistic Set-Covering Problem
• Title not available (Why is that?)
• A new reformulation approach for the generalized partial covering problem
• Set coverage and robust policy
• MIP reformulations of the probabilistic set covering problem
• A maximal covering location model in the presence of partial coverage

This page was built for publication: Probabilistic partial set covering problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202816)