IDEAS home Printed from https://ideas.repec.org/p/mit/sloanp/2700.html
   My bibliography  Save this paper

A fast algorithm for the bipartite node weighted matching problmem on path graphics with application to the inverse spanning tree problem

Author

Listed:
  • Ahuja, Ravindra K., 1956-
  • Orlin, James B., 1953-

Abstract

"(Revised February 14, 1998.)"--T.p. -- "February 1998"--Cover.

Suggested Citation

  • Ahuja, Ravindra K., 1956- & Orlin, James B., 1953-, 1998. "A fast algorithm for the bipartite node weighted matching problmem on path graphics with application to the inverse spanning tree problem," Working papers WP 4006-98., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    • Handle: RePEc:mit:sloanp:2700
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1721.1/2700
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ahuja, Ravindra K., 1956- & Orlin, James B., 1953-, 1998. "Combinatorial algorithms for inverse network flow problems," Working papers WP 4004-98., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ahuja, Ravindra K., 1956- & Orlin, James B., 1953-, 1998. "Inverse optimization," Working papers WP 4002-98., Massachusetts Institute of Technology (MIT), Sloan School of Management.

    More about this item

    Keywords

    HD28 .M414 no.4006-98;

    JEL classification:

    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:mit:sloanp:2700. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: None (email available below). General contact details of provider: https://edirc.repec.org/data/ssmitus.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.