IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v23y1975i1p150-158.html
   My bibliography  Save this article

A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem

Author

Listed:
  • Mokhtar S. Bazaraa

    (Georgia Institute of Technology, Atlanta, Georgia)

  • Jamie J. Goode

    (Georgia Institute of Technology, Atlanta, Georgia)

Abstract

This paper develops an algorithm to solve certain quadratic set-covering problems where the constraint set is of the inequality type. It extends one of B ellmore and R atliff for linear set-covering problems with involutory bases where cutting planes that exclude both integer and noninteger solutions are generated at each iteration. The new algorithm can be used to solve problems of the equality and mixed types by introducing a penalty term in the objective function. Computational experience with the new algorithm is presented.

Suggested Citation

  • Mokhtar S. Bazaraa & Jamie J. Goode, 1975. "A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem," Operations Research, INFORMS, vol. 23(1), pages 150-158, February.
    • Handle: RePEc:inm:oropre:v:23:y:1975:i:1:p:150-158
    DOI: 10.1287/opre.23.1.150
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. T Zhao & C-L Tseng, 2007. "Flexible facility interior layout: a real options approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(6), pages 729-739, June.
    2. Nihal Berktaş & Hande Yaman, 2021. "A Branch-and-Bound Algorithm for Team Formation on Social Networks," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1162-1176, July.
    3. Hu, Xiaoxuan & Zhu, Waiming & Ma, Huawei & An, Bo & Zhi, Yanling & Wu, Yi, 2021. "Orientational variable-length strip covering problem: A branch-and-price-based algorithm," European Journal of Operational Research, Elsevier, vol. 289(1), pages 254-269.

    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:inm:oropre:v:23:y:1975:i:1:p:150-158. 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.