MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Sloan School of Management
  • Sloan Working Papers
  • View Item
  • DSpace@MIT Home
  • Sloan School of Management
  • Sloan Working Papers
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Author(s)
Ahuja, Ravindra K., 1956-; Orlin, James B., 1953-; Sloan School of Management.
Thumbnail
DownloadSWP-4006-40963012.pdf (1.440Mb)
Metadata
Show full item record
Description
"(Revised February 14, 1998.)"--T.p. -- "February 1998"--Cover.
 
Includes bibliographical references (p. 20).
 
Date issued
1998
URI
http://hdl.handle.net/1721.1/2700
Publisher
Sloan School of Management, Massachusetts Institute of Technology
Other identifiers
#4006
Series/Report no.
Working paper (Sloan School of Management) ; WP 4006-98.

Collections
  • Sloan Working Papers

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.