A polynomial-time parametric simplex algorithm for the minimum cost network flow problem
DownloadSWP-1484-15467654.pdf (839.9Kb)
Metadata
Show full item recordDescription
"September 1983." Bibliography: p. [15]
Date issued
1983Publisher
Massachusetts Institute of Technology
Other identifiers
Sloan W.P, No. 1484-83
Series/Report no.
Working paper (Sloan School of Management) ; 1484-83.