Advanced Search
DSpace@MIT

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

Research and Teaching Output of the MIT Community

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

Download
Author: Ahuja, Ravindra K., 1956-; Orlin, James B., 1953-; Sloan School of Management.
Publisher: Sloan School of Management, Massachusetts Institute of Technology
Date Issued: 1998
Description:
"(Revised February 14, 1998.)"--T.p. -- "February 1998"--Cover.Includes bibliographical references (p. 20).
URI: http://hdl.handle.net/1721.1/2700
Other Identifiers: #4006
Series/Report no.: Working paper (Sloan School of Management) ; WP 4006-98.
Keywords: HD28 .M414 no.4006-98

Show full item metadata

Files in this item

Name Size Format Description
SWP-4006-40963012.pdf 1.440Mb PDF

This item appears in the following Collection(s)

MIT-Mirage