IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v47y1998i2p243-254.html
   My bibliography  Save this article

Persistency in the assignment and transportation problems

Author

Listed:
  • Katarina Cechlárová

Abstract

LetG=(U,V,E) be a bipartite graph with weights of its edgesc ij . For the assignment and transportation problem given by such a graph we propose efficient procedures for partitioning the edge setE into three classes:E o is the set of edgesij withx ij =0 for each optimum solution (0-persistent edges);E 1 is the set of edges withx ij > 0 and constant for each optimum (1-persistent edges) andE w is the set of edges such that there are two optimum solutions x, x′ withx ij ≠x ij 1 (weakly persistent edges). Copyright Physica-Verlag 1998

Suggested Citation

  • Katarina Cechlárová, 1998. "Persistency in the assignment and transportation problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 47(2), pages 243-254, June.
    • Handle: RePEc:spr:mathme:v:47:y:1998:i:2:p:243-254
    DOI: 10.1007/BF01194399
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF01194399
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF01194399?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:mathme:v:47:y:1998:i:2:p:243-254. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.