| dc.contributor |
Ahuja, Ravindra K., 1956- |
|
| dc.contributor |
Orlin, James B., 1953- |
|
| dc.contributor |
Sloan School of Management. |
|
| dc.date |
2003-04-29T05:16:02Z |
|
| dc.date |
2003-04-29T05:16:02Z |
|
| dc.date |
1998 |
|
| dc.date.accessioned |
2013-06-04T16:15:14Z |
|
| dc.date.available |
2013-06-04T16:15:14Z |
|
| dc.date.issued |
2013-06-05 |
|
| dc.identifier |
#4006 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/2700 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
Ravindra K. Ahuja, James B. Orlin. |
|
| dc.description |
"(Revised February 14, 1998.)"--T.p. -- "February 1998"--Cover. |
|
| dc.description |
Includes bibliographical references (p. 20). |
|
| dc.description |
Supported by a grant from the United Parcel Service and a contract from the Office of Naval Research. ONR N00014-96-1-0051 |
|
| dc.format |
20 p., 6 p. of plates |
|
| dc.format |
1510662 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
eng |
|
| dc.publisher |
Sloan School of Management, Massachusetts Institute of Technology |
|
| dc.relation |
Working paper (Sloan School of Management) ; WP 4006-98. |
|
| dc.subject |
HD28 .M414 no.4006-98 |
|
| dc.title |
A fast algorithm for the bipartite node weighted matching problmem on path graphics with application to the inverse spanning tree problem |
|