Search (Ex: crystalline silicon solar)
Search Within This Collection
Advanced Search
DSpace
@
MIT
Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems
Research and Teaching Output of the MIT Community
Home
→
Operations Research Center
→
Operations Research Center Working Papers
→
View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems
Download
Author:
Ahuja, Ravindra K., 1956-; Orlin, James B., 1953-
Citable URI:
http://hdl.handle.net/1721.1/5080
Publisher:
Massachusetts Institute of Technology, Operations Research Center
Date Issued:
1988
Description:
"November 1988."Includes bibliographical references (p. 24-26).
URI:
http://hdl.handle.net/1721.1/5080
Other Identifiers:
OR 189-88
Series/Report no.:
Operations Research Center Working Paper;OR 189-88
Show full item metadata
Files in this item
Name
Size
Format
Description
OR-189-88-45883576.pdf
1.828Mb
PDF
This item appears in the following Collection(s)
Operations Research Center Working Papers
Browse
All of DSpace@MIT
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
My Account
Login
Register
MIT-Mirage