An Algorithm for the Vertex Packing Problem

David J. Houck and R. Rao Vemuganti
Additional contact information
David J. Houck: University of Maryland, Baltimore, Maryland
R. Rao Vemuganti: University of Baltimore, Baltimore, Maryland

Operations Research, 1977, vol. 25, issue 5, 773-787

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.

Date: 1977
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.5.773 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:25:y:1977:i:5:p:773-787

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().