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

On the Set-Covering Problem

Author

Listed:
  • Egon Balas

    (Carnegie-Mellon University, Pittsburgh, Pennsylvania)

  • Manfred W. Padberg

    (Carnegie-Mellon University, Pittsburgh, Pennsylvania)

Abstract

This paper establishes some useful properties of the equality-constrained set-covering problem P and the associated linear program P ′. First, the Dantzig property of transportation matrices is shown to hold for a more general class of matrices arising in connection with adjacent integer solutions to P ′. Next, we show that, for every feasible integer basis to P ′, there are at least as many adjacent feasible integer bases as there are nonbasic columns. Finally, given any two basic feasible integer solutions x 1 and x 2 to P ′, x 2 can be obtained from x 1 by a sequence of p pivots (where p is the number of indices j ϵ N for which x j 1 is nonbasic and x j 2 = 1), such that each solution in the associated sequence is feasible and integer. Some of our results have been conjectured earlier by A ndrew , H offmann , and K rabek in a paper presented to ORSA in 1968.

Suggested Citation

  • Egon Balas & Manfred W. Padberg, 1972. "On the Set-Covering Problem," Operations Research, INFORMS, vol. 20(6), pages 1152-1161, December.
    • Handle: RePEc:inm:oropre:v:20:y:1972:i:6:p:1152-1161
    DOI: 10.1287/opre.20.6.1152
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.20.6.1152
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.20.6.1152?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. Adil Tahir & Guy Desaulniers & Issmail El Hallaoui, 2022. "Integral Column Generation for Set Partitioning Problems with Side Constraints," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2313-2331, July.
    2. Adil Tahir & Guy Desaulniers & Issmail El Hallaoui, 2019. "Integral column generation for the set partitioning problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 713-744, December.
    3. Rönnberg, Elina & Larsson, Torbjörn, 2009. "Column generation in the integral simplex method," European Journal of Operational Research, Elsevier, vol. 192(1), pages 333-342, January.
    4. Sujeevraja Sanjeevi & Saravanan Venkatachalam, 2021. "Robust flight schedules with stochastic programming," Annals of Operations Research, Springer, vol. 305(1), pages 403-421, October.
    5. Aardal, K. & van Hoesel, C.P.M., 1995. "Polyhedral techniques in combinatorial optimization," Research Memorandum 014, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    6. Abdelouahab Zaghrouti & François Soumis & Issmail El Hallaoui, 2014. "Integral Simplex Using Decomposition for the Set Partitioning Problem," Operations Research, INFORMS, vol. 62(2), pages 435-449, April.
    7. Abdelouahab Zaghrouti & Issmail El Hallaoui & François Soumis, 2018. "Improved integral simplex using decomposition for the set partitioning problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 185-206, June.
    8. Rönnberg, Elina & Larsson, Torbjörn, 2014. "All-integer column generation for set partitioning: Basic principles and extensions," European Journal of Operational Research, Elsevier, vol. 233(3), pages 529-538.
    9. Goldengorin, Boris, 2009. "Maximization of submodular functions: Theory and enumeration algorithms," European Journal of Operational Research, Elsevier, vol. 198(1), pages 102-112, October.
    10. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Other publications TiSEM ed028a07-eb6a-4c8d-8f21-d, Tilburg University, School of Economics and Management.
    11. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Discussion Paper 1995-57, Tilburg University, Center for Economic Research.
    12. Fernández, Elena & Pozo, Miguel A. & Puerto, Justo & Scozzari, Andrea, 2017. "Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem," European Journal of Operational Research, Elsevier, vol. 260(3), pages 886-903.
    13. Abdelouahab Zaghrouti & Issmail El Hallaoui & François Soumis, 2020. "Improving set partitioning problem solutions by zooming around an improving direction," Annals of Operations Research, Springer, vol. 284(2), pages 645-671, January.
    14. Elena Fernández & Justo Puerto & Antonio Rodríguez-Chía, 2013. "On discrete optimization with ordering," Annals of Operations Research, Springer, vol. 207(1), pages 83-96, August.

    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:20:y:1972:i:6:p:1152-1161. 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.