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 polynomial time primal network simplex algorithm for minimum cost flows

Author(s)
Orlin, James B., 1953-
Thumbnail
DownloadSWP-3834-33338649.pdf (1.919Mb)
Metadata
Show full item record
Description
Cover title.
 
Includes bibliographical references (p. 25-27).
 
Date issued
1995
URI
http://hdl.handle.net/1721.1/2584
Publisher
Sloan School of Management, Massachusetts Institute of Technology]
Other identifiers
#3834-95
Series/Report no.
Working paper (Sloan School of Management) ; 3834-95.

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.