IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v38y1991i1p41-51.html
   My bibliography  Save this article

Probabilistic partial set covering problems

Author

Listed:
  • Hanif D. Sherali
  • Seong‐In Kim
  • Edna L. Parrish

Abstract

In this article, we consider a situation in which a group of facilities need to be constructed in order to serve a given set of customers. However, the facilities cannot guarantee an absolute coverage to any of the customers. Hence, we formulate this problem as one of maximizing the total service reliability of the system subject to a budgetary constraint. For this problem, we develop and test suitable branch‐and‐bound algorithms and study the effect of problem parameters on solution difficulty. Some generalizations of this problem are also mentioned as possible extensions.

Suggested Citation

  • Hanif D. Sherali & Seong‐In Kim & Edna L. Parrish, 1991. "Probabilistic partial set covering problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(1), pages 41-51, February.
    • Handle: RePEc:wly:navres:v:38:y:1991:i:1:p:41-51
    DOI: 10.1002/1520-6750(199102)38:13.0.CO;2-L
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199102)38:13.0.CO;2-L
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199102)38:13.0.CO;2-L?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Beasley, J. E., 1987. "An algorithm for set covering problem," European Journal of Operational Research, Elsevier, vol. 31(1), pages 85-93, July.
    2. Eugene L. Lawler, 1979. "Fast Approximation Algorithms for Knapsack Problems," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 339-356, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ojeong Kwon & Donghan Kang & Kyungsik Lee & Sungsoo Park, 1999. "Lagrangian relaxation approach to the targeting problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(6), pages 640-653, September.
    2. Timothy C. Y. Chan & Derya Demirtas & Roy H. Kwon, 2016. "Optimizing the Deployment of Public Access Defibrillators," Management Science, INFORMS, vol. 62(12), pages 3617-3635, December.
    3. Youngho Lee & Hanif D. Sherali & Ikhyun Kwon & Seongin Kim, 2006. "A new reformulation approach for the generalized partial covering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(2), pages 170-179, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Aardal, Karen & van den Berg, Pieter L. & Gijswijt, Dion & Li, Shanfei, 2015. "Approximation algorithms for hard capacitated k-facility location problems," European Journal of Operational Research, Elsevier, vol. 242(2), pages 358-368.
    2. Haris Aziz & Sujit Gujar & Manisha Padala & Mashbat Suzuki & Jeremy Vollen, 2022. "Coordinating Monetary Contributions in Participatory Budgeting," Papers 2206.05966, arXiv.org, revised Feb 2023.
    3. Helena R. Lourenço & José P. Paixão & Rita Portugal, 2001. "Multiobjective Metaheuristics for the Bus Driver Scheduling Problem," Transportation Science, INFORMS, vol. 35(3), pages 331-343, August.
    4. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    5. Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
    6. Wang, Yiyuan & Pan, Shiwei & Al-Shihabi, Sameh & Zhou, Junping & Yang, Nan & Yin, Minghao, 2021. "An improved configuration checking-based algorithm for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 294(2), pages 476-491.
    7. Grossman, Tal & Wool, Avishai, 1997. "Computational experience with approximation algorithms for the set covering problem," European Journal of Operational Research, Elsevier, vol. 101(1), pages 81-92, August.
    8. J. E. Beasley, 1990. "A lagrangian heuristic for set‐covering problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(1), pages 151-164, February.
    9. Kameng Nip & Zhenbo Wang, 2019. "On the approximability of the two-phase knapsack problem," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1155-1179, November.
    10. Victor Reyes & Ignacio Araya, 2021. "A GRASP-based scheme for the set covering problem," Operational Research, Springer, vol. 21(4), pages 2391-2408, December.
    11. Nguyen, Tri-Dung, 2014. "A fast approximation algorithm for solving the complete set packing problem," European Journal of Operational Research, Elsevier, vol. 237(1), pages 62-70.
    12. Alejandro Lara-Caballero & Diego González-Moreno, 2023. "A Population-Based Local Search Algorithm for the Identifying Code Problem," Mathematics, MDPI, vol. 11(20), pages 1-17, October.
    13. Helena Ramalhinho-Lourenço, 2001. "The crew-scheduling module in the GIST system," Economics Working Papers 547, Department of Economics and Business, Universitat Pompeu Fabra.
    14. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    15. Ruxian Wang & Ozge Sahin, 2018. "The Impact of Consumer Search Cost on Assortment Planning and Pricing," Management Science, INFORMS, vol. 64(8), pages 3649-3666, August.
    16. Rui Diao & Ya-Feng Liu & Yu-Hong Dai, 2017. "A new fully polynomial time approximation scheme for the interval subset sum problem," Journal of Global Optimization, Springer, vol. 68(4), pages 749-775, August.
    17. Zhenbo Wang & Wenxun Xing, 2009. "A successive approximation algorithm for the multiple knapsack problem," Journal of Combinatorial Optimization, Springer, vol. 17(4), pages 347-366, May.
    18. J. E. Beasley, 2024. "An optimal algorithm for variable knockout problems," 4OR, Springer, vol. 22(4), pages 419-433, December.
    19. Kameshwaran, S. & Narahari, Y., 2009. "Nonconvex piecewise linear knapsack problems," European Journal of Operational Research, Elsevier, vol. 192(1), pages 56-68, January.
    20. Jenkins , Alan, 2005. "Performance Appraisal Research: A Critical Review of Work on “The Social Context and Politics of Appraisal”," ESSEC Working Papers DR 05004, ESSEC Research Center, ESSEC Business School.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:38:y:1991:i:1:p:41-51. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.