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

An Algorithm for the Vertex Packing Problem

Author

Listed:
  • David J. Houck

    (University of Maryland, Baltimore, Maryland)

  • R. Rao Vemuganti

    (University of Baltimore, Baltimore, Maryland)

Abstract

This paper presents several properties of the vertex packing problem and develops an algorithm for its solution. We show a relationship between the vertex packing problem on the original graph and on a class of related bipartite graphs. This can be used to generate good initial solutions, which in some cases are known to be optimal. We also show that the group-theoretic approach to integer programming, when applied to vertex packing, yields a trivial group problem regardless of the determinant of the associated basis matrix. These ideas are incorporated into an algorithm and computational experience is presented.

Suggested Citation

  • David J. Houck & R. Rao Vemuganti, 1977. "An Algorithm for the Vertex Packing Problem," Operations Research, INFORMS, vol. 25(5), pages 773-787, October.
    • Handle: RePEc:inm:oropre:v:25:y:1977:i:5:p:773-787
    DOI: 10.1287/opre.25.5.773
    as

    Download full text from publisher

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

    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:25:y:1977:i:5:p:773-787. 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.