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

A Graph-Theoretic Approach to a Class of Integer-Programming Problems

Author

Listed:
  • J. F. Desler

    (Shell Development Company, Houston, Texas)

  • S. L. Hakimi

    (Northwestern University, Evanston, Illinois)

Abstract

This paper presents an efficient algorithm for finding a minimum-weight generalized matching in a weighted bipartite graph. Computational evidence is given that indicates that the time required to find a least-cost assignment of n jobs to n workers goes roughly as n 2 for 10 ≦ n ≦ 50. It is shown that this algorithm can be used to solve effectively the well known transportation problem of integer programming where the objective function is convex-separable. Finally, the paper gives an algorithm that applies the same concept to a graph that is not necessarily bipartite.

Suggested Citation

  • J. F. Desler & S. L. Hakimi, 1969. "A Graph-Theoretic Approach to a Class of Integer-Programming Problems," Operations Research, INFORMS, vol. 17(6), pages 1017-1033, December.
    • Handle: RePEc:inm:oropre:v:17:y:1969:i:6:p:1017-1033
    DOI: 10.1287/opre.17.6.1017
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.17.6.1017
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.17.6.1017?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:17:y:1969:i:6:p:1017-1033. 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.