IDEAS home Printed from https://ideas.repec.org/a/wsi/ijitdm/v13y2014i05ns0219622014500692.html
   My bibliography  Save this article

On Set Covering Based on Biclustering

Author

Listed:
  • Antiopi Panteli

    (Department of Business Administration, MIS & Business Intelligence Lab, University of Patras Rio, 26500, Greece)

  • Basilis Boutsinas

    (Department of Business Administration, MIS & Business Intelligence Lab, University of Patras Rio, 26500, Greece)

  • Ioannis Giannikos

    (Department of Business Administration, Laboratory of Research and Tourism Satellite Accounts, University of Patras Rio, 26500, Greece)

Abstract

In this paper, we present a clustering heuristic for solving demand covering models where the objective is to determine locations for servers that optimally cover a given set of demand points. This heuristic is based on the concept of biclusters and processes the set of demand points as well as the set of potential servers and determines biclusters that result in smaller problems. Given a coverage matrix, a bicluster is defined as a sub-matrix spanned by both a subset of rows and a subset of columns, such that rows are the most similar to each other when compared over columns. The algorithm starts by using any biclustering algorithm in order to identify appropriate biclusters of the coverage matrix and then combines selected biclusters to define an aggregate solution to the original problem. The algorithm can be easily adapted to address a whole family of covering problems including set covering, maximal covering and backup covering problems. The proposed algorithm is tested in a series of widely known test datasets for various such problems. The main objective of this paper is to introduce the concept of biclustering as an efficient and effective approach to tackle covering problems and to stimulate further research in this area.

Suggested Citation

  • Antiopi Panteli & Basilis Boutsinas & Ioannis Giannikos, 2014. "On Set Covering Based on Biclustering," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 13(05), pages 1029-1049.
    • Handle: RePEc:wsi:ijitdm:v:13:y:2014:i:05:n:s0219622014500692
    DOI: 10.1142/S0219622014500692
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219622014500692
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219622014500692?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Antiopi Panteli & Basilis Boutsinas & Ioannis Giannikos, 2021. "On solving the multiple p-median problem based on biclustering," Operational Research, Springer, vol. 21(1), pages 775-799, March.
    2. George Telonis & Antiopi Panteli & Basilis Boutsinas, 2023. "A Point-of-Interest Recommender System for Tourist Groups Based on Cooperative Location Set Cover Problem," Mathematics, MDPI, vol. 11(17), pages 1-19, August.

    More about this item

    Keywords

    Set covering; biclustering; clustering; 90B50; 90C05; 62H30; 68T10;
    All these keywords.

    JEL classification:

    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:wsi:ijitdm:v:13:y:2014:i:05:n:s0219622014500692. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijitdm/ijitdm.shtml .

    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.