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

Variants of the hungarian method for assignment problems

Author

Listed:
  • H. W. Kuhn

Abstract

No abstract is available for this item.

Suggested Citation

  • H. W. Kuhn, 1956. "Variants of the hungarian method for assignment problems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(4), pages 253-258, December.
    • Handle: RePEc:wly:navlog:v:3:y:1956:i:4:p:253-258
    DOI: 10.1002/nav.3800030404
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800030404
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800030404?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. Estate V. Khmaladze, 2021. "Distribution-free testing in linear and parametric regression," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 73(6), pages 1063-1087, December.
    2. Wei, Wei & Feng, Xiangnan, 2023. "Graphical representation and hierarchical decomposition mechanism for vertex-cover solution space," Applied Mathematics and Computation, Elsevier, vol. 458(C).
    3. Hend Bouziri & Khaled Mellouli & El-Ghazali Talbi, 2011. "The k-coloring fitness landscape," Journal of Combinatorial Optimization, Springer, vol. 21(3), pages 306-329, April.
    4. Helena Gaspars-Wieloch, 2021. "The Assignment Problem in Human Resource Project Management under Uncertainty," Risks, MDPI, vol. 9(1), pages 1-17, January.
    5. Ivan Belik & Kurt Jornsten, 2018. "Critical objective function values in linear sum assignment problems," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 842-852, April.
    6. Li, Miao & Davari, Morteza & Goossens, Dries, 2023. "Multi-league sports scheduling with different leagues sizes," European Journal of Operational Research, Elsevier, vol. 307(1), pages 313-327.
    7. Amnon Rosenmann, 2022. "Computing the sequence of k-cardinality assignments," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1265-1283, September.
    8. Ekta Jain & Kalpana Dahiya & Vanita Verma, 2020. "A priority based unbalanced time minimization assignment problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 13-45, March.
    9. Mehran Farzadmehr & Valentin Carlan & Thierry Vanelslander, 2023. "Contemporary challenges and AI solutions in port operations: applying Gale–Shapley algorithm to find best matches," Journal of Shipping and Trade, Springer, vol. 8(1), pages 1-44, December.

    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:3:y:1956:i:4:p:253-258. 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.