IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v18y1990i2p195-201.html
   My bibliography  Save this article

Set covering and set partitioning: A collection of test problems

Author

Listed:
  • El-Darzi, E
  • Mitra, G

Abstract

It is now well established that set covering and set partitioning models play a central role in many scheduling applications. There are many algorithms which solve these problems. In order to test and validate implementations of such algorithms we have collected a range of test problems taken from different contexts. A brief description of these models, their applications and summary model data, are supplied in this paper.

Suggested Citation

  • El-Darzi, E & Mitra, G, 1990. "Set covering and set partitioning: A collection of test problems," Omega, Elsevier, vol. 18(2), pages 195-201.
    • Handle: RePEc:eee:jomega:v:18:y:1990:i:2:p:195-201
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(90)90066-I
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Amy Cohn & Sarah Root & Alex Wang & Douglas Mohr, 2007. "Integration of the Load-Matching and Routing Problem with Equipment Balancing for Small Package Carriers," Transportation Science, INFORMS, vol. 41(2), pages 238-252, May.
    2. El-Darzi, Elia & Mitra, Gautam, 1995. "Graph theoretic relaxations of set covering and set partitioning problems," European Journal of Operational Research, Elsevier, vol. 87(1), pages 109-121, November.

    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:eee:jomega:v:18:y:1990:i:2:p:195-201. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.