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

Technical Note—A Polynomial Simplex Method for the Assignment Problem

Author

Listed:
  • Ming S. Hung

    (Kent State University, Kent, Ohio)

Abstract

We present a polynomial primal simplex algorithm for the assignment problem. For n × n assignment problem with integer cost coefficients, the algorithm generates at most n 3 ln ▵ bases prior to reach the optimal basis, where ▵ is the difference in objective value between an initial extreme point and the optimal extreme point.

Suggested Citation

  • Ming S. Hung, 1983. "Technical Note—A Polynomial Simplex Method for the Assignment Problem," Operations Research, INFORMS, vol. 31(3), pages 595-600, June.
    • Handle: RePEc:inm:oropre:v:31:y:1983:i:3:p:595-600
    DOI: 10.1287/opre.31.3.595
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.31.3.595
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.31.3.595?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. Michael Z. Spivey & Warren B. Powell, 2004. "The Dynamic Assignment Problem," Transportation Science, INFORMS, vol. 38(4), pages 399-419, November.
    2. Nilotpal Chakravarti, 1992. "Isotonic median regression for orders representable by rooted trees," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(5), pages 599-611, August.
    3. Konstantinos Paparrizos & Nikolaos Samaras & Angelo Sifaleras, 2015. "Exterior point simplex-type algorithms for linear and network optimization problems," Annals of Operations Research, Springer, vol. 229(1), pages 607-633, June.

    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:31:y:1983:i:3:p:595-600. 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.