Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2700| Title: | A fast algorithm for the bipartite node weighted matching problmem on path graphics with application to the inverse spanning tree problem |
| Authors: | Ahuja, Ravindra K., 1956- Orlin, James B., 1953- Sloan School of Management. |
| Keywords: | HD28 .M414 no.4006-98 |
| Issue Date: | 5-Jun-2013 |
| Publisher: | Sloan School of Management, Massachusetts Institute of Technology |
| Description: | Ravindra K. Ahuja, James B. Orlin. "(Revised February 14, 1998.)"--T.p. -- "February 1998"--Cover. Includes bibliographical references (p. 20). Supported by a grant from the United Parcel Service and a contract from the Office of Naval Research. ONR N00014-96-1-0051 |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | #4006 http://hdl.handle.net/1721.1/2700 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.