IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v14y1967i3p313-316.html
   My bibliography  Save this article

Maximum matching in a convex bipartite graph

Author

Listed:
  • Fred Glover

Abstract

A special matching problem arising in industry is shown to be solvable by an algorithm of the form: match objects ai and bj if they satisfy a local optirnality criterion based on a ranking of currently unmatched objects. When no ai and bi remain that can be matched, the largest number of acceptable matches has been found.

Suggested Citation

  • Fred Glover, 1967. "Maximum matching in a convex bipartite graph," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 14(3), pages 313-316.
    • Handle: RePEc:wly:navlog:v:14:y:1967:i:3:p:313-316
    DOI: 10.1002/nav.3800140304
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800140304
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800140304?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. Quan Zu & Miaomiao Zhang & Bin Yu, 2016. "Dynamic matchings in left vertex weighted convex bipartite graphs," Journal of Combinatorial Optimization, Springer, vol. 32(1), pages 25-50, July.
    2. Tolga Çezik & Oktay Günlük, 2004. "Reformulating linear programs with transportation constraints—With applications to workforce scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(2), pages 275-296, March.
    3. Geir Dahl & Njål Foldnes, 2006. "LP based heuristics for the multiple knapsack problem with assignment restrictions," Annals of Operations Research, Springer, vol. 146(1), pages 91-104, September.

    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:wly:navlog:v:14:y:1967:i:3:p:313-316. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.