SIGN IN
SIGN UP
An improved primal simplex variant for pure processing networks
Full Text:
PDF
Buy this Article
Authors:
Michael D. Chang
Gonzaga Univ., Spokane, WA
Chou-Hong J. Chen
Gonzaga Univ., Spokane, WA
Michael Engquist
Cleveland Consulting Associates, Austin, TX
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 15 Issue 1, March 1989
Pages 64-78
ACM
New York, NY
, USA
table of contents
doi>
10.1145/62038.62041
1989 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 10
· Downloads (cumulative): 277
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
design
efficiency
linear programming
network problems
performance
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder