DSpace Repository
A polynomial time primal network simplex algorithm for minimum cost flows
Login
English
العربية
DSpace Home
→
Harvested articles مقالات مستوردة من مؤسسات وجامعات عالمية
→
MIT Items
→
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
Orlin, James B., 1953-
URI:
http://koha.mediu.edu.my:8181/xmlui/handle/1721
Date:
2013-06-05
Description:
by James B. Orlin.
Cover title.
Includes bibliographical references (p. 25-27).
Supported by ONR. N00014-94-1-0099 Supported in part by a grant from the UPS foundation.
Show full item record
Files in this item
Files
Size
Format
View
There are no files associated with this item.
This item appears in the following Collection(s)
MIT Items
Search DSpace
Search DSpace
This Collection
Advanced Search
Browse
All of DSpace
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
My Account
Login
Register