IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/5359691.html
   My bibliography  Save this article

The Relationship between the Unicost Set Covering Problem and the Attribute Reduction Problem in Rough Set Theory

Author

Listed:
  • Qingyuan Xu
  • Jinjin Li

Abstract

The unicost set covering problem and the attribute reduction problem are NP-complete problems. In this paper, the relationship between these two problems are discussed. Based on the transformability between attribute reductions and minimal solutions in unicost set covering models, two methods are provided. One is to induce an information table from a given unicost set covering model. With no doubt, it shows that the unicost set covering problem can be investigated by rough set theory. The other is to induce a unicost set covering model from a given information table. Similarly, it shows that the attribute reduction problem can be studied by set covering theory. As an application of the proposed theoretical results, a rough set heuristic algorithm is presented for the unicost set covering problem.

Suggested Citation

  • Qingyuan Xu & Jinjin Li, 2020. "The Relationship between the Unicost Set Covering Problem and the Attribute Reduction Problem in Rough Set Theory," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-12, June.
    • Handle: RePEc:hin:jnlmpe:5359691
    DOI: 10.1155/2020/5359691
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2020/5359691.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2020/5359691.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2020/5359691?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
    ---><---

    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:hin:jnlmpe:5359691. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.