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

Name

SWP-4006-40963012.pdf

Size

1.44 MB

Format

Adobe PDF

Checksum (MD5)

e02627a4df3ff56c59dd3c564bd3657d

Date Issued

1998

Publisher

Sloan School of Management, Massachusetts Institute of Technology

Series/Report no.

Working paper (Sloan School of Management) ; WP 4006-98.

Description

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

Includes bibliographical references (p. 20).

Persistent DSpace Link