IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v36y1990i6p674-688.html
   My bibliography  Save this article

Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics

Author

Listed:
  • Marshall L. Fisher

    (Department of Decision Sciences, The Wharton School, University of Pennsylvania, Philadelphia, Pennsylvania 19104-6366)

  • Pradeep Kedia

    (College of Business Administration, Northeastern University, Boston, Massachusetts 02115)

Abstract

We present an algorithm for a mixed set covering/partitioning model that includes as special cases the well-known set covering problem and set partitioning problem. The novel feature of our algorithm is the use of continuous heuristics applied to the dual of the linear programming relaxation to provide lower bounds for a branch and bound algorithm. The heuristics are continuous adaptations of the well-known greedy and 3-opt methods that have been applied to a variety of combinatorial optimization problems. Our algorithm has outperformed the current best set covering algorithm of Balas and Ho (1980) by about a factor of 3, and appears to improve on the best existing set partitioning algorithm by more than an order of magnitude.

Suggested Citation

  • Marshall L. Fisher & Pradeep Kedia, 1990. "Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics," Management Science, INFORMS, vol. 36(6), pages 674-688, June.
    • Handle: RePEc:inm:ormnsc:v:36:y:1990:i:6:p:674-688
    DOI: 10.1287/mnsc.36.6.674
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.36.6.674
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.36.6.674?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
    ---><---

    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:inm:ormnsc:v:36:y:1990:i:6:p:674-688. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.